./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6205dd28357a99a6dad8b2de9851083e86ce6af9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 20:45:29,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 20:45:29,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 20:45:29,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 20:45:29,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 20:45:29,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 20:45:29,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 20:45:29,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 20:45:29,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 20:45:29,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 20:45:29,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 20:45:29,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 20:45:29,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 20:45:29,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 20:45:29,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 20:45:29,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 20:45:29,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 20:45:29,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 20:45:29,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 20:45:29,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 20:45:29,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 20:45:29,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 20:45:29,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 20:45:29,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 20:45:29,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 20:45:29,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 20:45:29,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 20:45:29,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 20:45:29,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 20:45:29,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 20:45:29,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 20:45:29,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 20:45:29,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 20:45:29,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 20:45:29,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 20:45:29,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 20:45:29,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 20:45:29,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 20:45:29,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 20:45:29,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 20:45:29,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 20:45:29,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 20:45:29,233 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 20:45:29,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 20:45:29,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 20:45:29,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 20:45:29,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 20:45:29,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 20:45:29,242 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 20:45:29,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 20:45:29,242 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 20:45:29,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 20:45:29,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 20:45:29,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 20:45:29,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 20:45:29,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 20:45:29,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 20:45:29,245 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 20:45:29,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 20:45:29,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 20:45:29,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 20:45:29,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 20:45:29,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 20:45:29,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 20:45:29,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 20:45:29,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 20:45:29,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 20:45:29,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 20:45:29,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 20:45:29,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 20:45:29,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 20:45:29,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 20:45:29,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6205dd28357a99a6dad8b2de9851083e86ce6af9 [2021-10-05 20:45:29,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 20:45:29,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 20:45:29,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 20:45:29,754 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 20:45:29,754 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 20:45:29,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-05 20:45:29,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/970da0bd4/47369dd52c5c46a5bd60b094bce27fdd/FLAG693a709fc [2021-10-05 20:45:30,491 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 20:45:30,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-05 20:45:30,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/970da0bd4/47369dd52c5c46a5bd60b094bce27fdd/FLAG693a709fc [2021-10-05 20:45:30,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/970da0bd4/47369dd52c5c46a5bd60b094bce27fdd [2021-10-05 20:45:30,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 20:45:30,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 20:45:30,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 20:45:30,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 20:45:30,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 20:45:30,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 08:45:30" (1/1) ... [2021-10-05 20:45:30,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4906660c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:30, skipping insertion in model container [2021-10-05 20:45:30,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 08:45:30" (1/1) ... [2021-10-05 20:45:30,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 20:45:30,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 20:45:31,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c[2567,2580] [2021-10-05 20:45:31,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 20:45:31,106 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 20:45:31,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c[2567,2580] [2021-10-05 20:45:31,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 20:45:31,154 INFO L208 MainTranslator]: Completed translation [2021-10-05 20:45:31,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31 WrapperNode [2021-10-05 20:45:31,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 20:45:31,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 20:45:31,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 20:45:31,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 20:45:31,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 20:45:31,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 20:45:31,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 20:45:31,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 20:45:31,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 20:45:31,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 20:45:31,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 20:45:31,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 20:45:31,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (1/1) ... [2021-10-05 20:45:31,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 20:45:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:31,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 20:45:31,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 20:45:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 20:45:31,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 20:45:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 20:45:31,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 20:45:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 20:45:31,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 20:45:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 20:45:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 20:45:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 20:45:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-05 20:45:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 20:45:31,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 20:45:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 20:45:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 20:45:31,364 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 20:45:31,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 20:45:31,835 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-05 20:45:31,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 08:45:31 BoogieIcfgContainer [2021-10-05 20:45:31,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 20:45:31,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 20:45:31,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 20:45:31,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 20:45:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 08:45:30" (1/3) ... [2021-10-05 20:45:31,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f719ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 08:45:31, skipping insertion in model container [2021-10-05 20:45:31,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 08:45:31" (2/3) ... [2021-10-05 20:45:31,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f719ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 08:45:31, skipping insertion in model container [2021-10-05 20:45:31,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 08:45:31" (3/3) ... [2021-10-05 20:45:31,847 INFO L111 eAbstractionObserver]: Analyzing ICFG chromosome-trans.wvr.c [2021-10-05 20:45:31,852 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 20:45:31,853 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 20:45:31,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 20:45:31,857 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 20:45:31,926 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,926 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,926 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,927 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,927 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,927 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,928 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,928 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,928 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,928 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,929 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,929 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,929 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,929 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,930 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,930 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,930 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,931 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,931 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,931 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,931 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,932 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,932 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,932 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,933 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,933 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,933 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,933 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,934 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,934 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,934 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,934 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,935 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,936 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,936 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,936 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,936 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,937 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,937 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,937 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,937 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,938 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,938 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,938 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,939 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,940 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,940 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,942 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,943 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,943 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,943 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,944 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,944 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,944 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,944 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,945 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,947 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,948 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,948 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,948 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,948 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,949 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,949 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,949 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,949 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,949 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,950 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,950 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,951 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,951 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,951 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,951 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,952 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,952 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,952 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,952 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,953 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,953 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,953 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,953 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,954 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,954 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,954 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,954 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,955 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,955 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,955 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,956 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,956 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,956 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,956 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,957 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,957 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,957 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,957 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,958 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,958 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,958 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,958 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,958 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,959 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,959 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,959 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,959 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,960 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,960 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,960 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,960 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,961 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,961 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,964 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,965 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,965 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,965 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,966 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,966 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,966 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,966 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,972 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,972 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,972 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,973 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,973 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,974 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,975 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,976 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,976 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,976 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,977 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 20:45:31,988 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 20:45:32,040 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 20:45:32,047 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 20:45:32,048 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 20:45:32,074 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 20:45:32,087 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 216 transitions, 456 flow [2021-10-05 20:45:32,090 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 216 transitions, 456 flow [2021-10-05 20:45:32,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 216 transitions, 456 flow [2021-10-05 20:45:32,200 INFO L129 PetriNetUnfolder]: 22/213 cut-off events. [2021-10-05 20:45:32,200 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 20:45:32,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 22/213 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2021-10-05 20:45:32,218 INFO L116 LiptonReduction]: Number of co-enabled transitions 4272 [2021-10-05 20:45:39,297 INFO L131 LiptonReduction]: Checked pairs total: 4927 [2021-10-05 20:45:39,297 INFO L133 LiptonReduction]: Total number of compositions: 218 [2021-10-05 20:45:39,307 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 96 flow [2021-10-05 20:45:39,335 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 173 states, 172 states have (on average 3.5697674418604652) internal successors, (614), 172 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 172 states have (on average 3.5697674418604652) internal successors, (614), 172 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:39,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-05 20:45:39,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:39,351 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:39,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1901330549, now seen corresponding path program 1 times [2021-10-05 20:45:39,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:39,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580025488] [2021-10-05 20:45:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:39,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 20:45:39,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:39,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580025488] [2021-10-05 20:45:39,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580025488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:39,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 20:45:39,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 20:45:39,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544207850] [2021-10-05 20:45:39,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 20:45:39,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 20:45:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 20:45:39,792 INFO L87 Difference]: Start difference. First operand has 173 states, 172 states have (on average 3.5697674418604652) internal successors, (614), 172 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:39,836 INFO L93 Difference]: Finished difference Result 176 states and 617 transitions. [2021-10-05 20:45:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 20:45:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-05 20:45:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:39,852 INFO L225 Difference]: With dead ends: 176 [2021-10-05 20:45:39,853 INFO L226 Difference]: Without dead ends: 176 [2021-10-05 20:45:39,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 20:45:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-10-05 20:45:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-10-05 20:45:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 3.525714285714286) internal successors, (617), 175 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 617 transitions. [2021-10-05 20:45:39,914 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 617 transitions. Word has length 22 [2021-10-05 20:45:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:39,915 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 617 transitions. [2021-10-05 20:45:39,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 617 transitions. [2021-10-05 20:45:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-05 20:45:39,918 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:39,919 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:39,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 20:45:39,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1193845835, now seen corresponding path program 1 times [2021-10-05 20:45:39,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:39,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077049501] [2021-10-05 20:45:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:39,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-05 20:45:40,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:40,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077049501] [2021-10-05 20:45:40,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077049501] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:40,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995066765] [2021-10-05 20:45:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:40,034 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:40,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:40,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-05 20:45:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-05 20:45:40,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-05 20:45:40,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995066765] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:40,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:40,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-10-05 20:45:40,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241535322] [2021-10-05 20:45:40,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-05 20:45:40,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:40,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-05 20:45:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-05 20:45:40,347 INFO L87 Difference]: Start difference. First operand 176 states and 617 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:40,399 INFO L93 Difference]: Finished difference Result 179 states and 620 transitions. [2021-10-05 20:45:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-05 20:45:40,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-05 20:45:40,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:40,406 INFO L225 Difference]: With dead ends: 179 [2021-10-05 20:45:40,406 INFO L226 Difference]: Without dead ends: 179 [2021-10-05 20:45:40,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-10-05 20:45:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-10-05 20:45:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-10-05 20:45:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 3.4831460674157304) internal successors, (620), 178 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 620 transitions. [2021-10-05 20:45:40,434 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 620 transitions. Word has length 25 [2021-10-05 20:45:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:40,435 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 620 transitions. [2021-10-05 20:45:40,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 620 transitions. [2021-10-05 20:45:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-05 20:45:40,439 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:40,439 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:40,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:40,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:40,654 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -301028235, now seen corresponding path program 2 times [2021-10-05 20:45:40,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:40,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851345577] [2021-10-05 20:45:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:40,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-05 20:45:40,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:40,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851345577] [2021-10-05 20:45:40,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851345577] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:40,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515573988] [2021-10-05 20:45:40,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-05 20:45:40,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:40,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:40,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-05 20:45:40,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-05 20:45:40,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:40,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-05 20:45:40,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-05 20:45:40,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515573988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:40,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-05 20:45:40,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2021-10-05 20:45:40,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755000657] [2021-10-05 20:45:40,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 20:45:40,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 20:45:40,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-05 20:45:40,920 INFO L87 Difference]: Start difference. First operand 179 states and 620 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:40,935 INFO L93 Difference]: Finished difference Result 300 states and 1073 transitions. [2021-10-05 20:45:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 20:45:40,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-05 20:45:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:40,940 INFO L225 Difference]: With dead ends: 300 [2021-10-05 20:45:40,941 INFO L226 Difference]: Without dead ends: 255 [2021-10-05 20:45:40,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-05 20:45:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-05 20:45:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 217. [2021-10-05 20:45:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 3.314814814814815) internal successors, (716), 216 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 716 transitions. [2021-10-05 20:45:40,961 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 716 transitions. Word has length 28 [2021-10-05 20:45:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:40,962 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 716 transitions. [2021-10-05 20:45:40,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 716 transitions. [2021-10-05 20:45:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-05 20:45:40,966 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:40,966 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:40,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:41,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:41,181 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:41,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1614593525, now seen corresponding path program 1 times [2021-10-05 20:45:41,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:41,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124625474] [2021-10-05 20:45:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:41,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-05 20:45:41,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:41,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124625474] [2021-10-05 20:45:41,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124625474] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:41,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877244590] [2021-10-05 20:45:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:41,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:41,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:41,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-05 20:45:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:41,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-05 20:45:41,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-05 20:45:41,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877244590] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:41,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:41,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-10-05 20:45:41,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082216658] [2021-10-05 20:45:41,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 20:45:41,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:41,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 20:45:41,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:41,539 INFO L87 Difference]: Start difference. First operand 217 states and 716 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:41,635 INFO L93 Difference]: Finished difference Result 354 states and 1193 transitions. [2021-10-05 20:45:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 20:45:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-05 20:45:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:41,644 INFO L225 Difference]: With dead ends: 354 [2021-10-05 20:45:41,644 INFO L226 Difference]: Without dead ends: 354 [2021-10-05 20:45:41,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-05 20:45:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 296. [2021-10-05 20:45:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.3457627118644067) internal successors, (987), 295 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 987 transitions. [2021-10-05 20:45:41,667 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 987 transitions. Word has length 30 [2021-10-05 20:45:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:41,667 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 987 transitions. [2021-10-05 20:45:41,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 987 transitions. [2021-10-05 20:45:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-05 20:45:41,672 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:41,672 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:41,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:41,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:41,887 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1074048053, now seen corresponding path program 2 times [2021-10-05 20:45:41,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:41,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873403050] [2021-10-05 20:45:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:41,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-05 20:45:42,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:42,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873403050] [2021-10-05 20:45:42,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873403050] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:42,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774350034] [2021-10-05 20:45:42,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-05 20:45:42,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:42,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:42,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-05 20:45:42,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-05 20:45:42,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:42,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-10-05 20:45:42,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774350034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:42,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-05 20:45:42,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-10-05 20:45:42,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939761133] [2021-10-05 20:45:42,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 20:45:42,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 20:45:42,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:42,229 INFO L87 Difference]: Start difference. First operand 296 states and 987 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:42,278 INFO L93 Difference]: Finished difference Result 628 states and 2025 transitions. [2021-10-05 20:45:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-05 20:45:42,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-05 20:45:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:42,300 INFO L225 Difference]: With dead ends: 628 [2021-10-05 20:45:42,300 INFO L226 Difference]: Without dead ends: 612 [2021-10-05 20:45:42,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 38.1ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-05 20:45:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-10-05 20:45:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 306. [2021-10-05 20:45:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.3377049180327867) internal successors, (1018), 305 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 1018 transitions. [2021-10-05 20:45:42,324 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 1018 transitions. Word has length 35 [2021-10-05 20:45:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:42,325 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 1018 transitions. [2021-10-05 20:45:42,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 1018 transitions. [2021-10-05 20:45:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-05 20:45:42,331 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:42,331 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:42,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:42,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:42,546 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 254981513, now seen corresponding path program 3 times [2021-10-05 20:45:42,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:42,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807426242] [2021-10-05 20:45:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:42,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-05 20:45:42,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:42,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807426242] [2021-10-05 20:45:42,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807426242] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:42,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082982556] [2021-10-05 20:45:42,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-05 20:45:42,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:42,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:42,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-05 20:45:42,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-10-05 20:45:42,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:42,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:42,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-10-05 20:45:42,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082982556] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:42,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-05 20:45:42,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-10-05 20:45:42,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023006996] [2021-10-05 20:45:42,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 20:45:42,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 20:45:42,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:42,842 INFO L87 Difference]: Start difference. First operand 306 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:42,867 INFO L93 Difference]: Finished difference Result 660 states and 2152 transitions. [2021-10-05 20:45:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-05 20:45:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-05 20:45:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:42,874 INFO L225 Difference]: With dead ends: 660 [2021-10-05 20:45:42,874 INFO L226 Difference]: Without dead ends: 660 [2021-10-05 20:45:42,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-10-05 20:45:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 354. [2021-10-05 20:45:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.3427762039660056) internal successors, (1180), 353 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1180 transitions. [2021-10-05 20:45:42,897 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1180 transitions. Word has length 35 [2021-10-05 20:45:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:42,901 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 1180 transitions. [2021-10-05 20:45:42,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1180 transitions. [2021-10-05 20:45:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-05 20:45:42,904 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:42,904 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:42,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:43,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:43,118 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:43,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2062824533, now seen corresponding path program 4 times [2021-10-05 20:45:43,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:43,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751613801] [2021-10-05 20:45:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:43,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-05 20:45:43,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:43,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751613801] [2021-10-05 20:45:43,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751613801] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:43,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622650157] [2021-10-05 20:45:43,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-05 20:45:43,234 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:43,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:43,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:43,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-05 20:45:43,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-05 20:45:43,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:43,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:43,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-05 20:45:43,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622650157] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:43,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:43,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-10-05 20:45:43,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422186856] [2021-10-05 20:45:43,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 20:45:43,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 20:45:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:43,481 INFO L87 Difference]: Start difference. First operand 354 states and 1180 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:43,565 INFO L93 Difference]: Finished difference Result 519 states and 1752 transitions. [2021-10-05 20:45:43,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 20:45:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-05 20:45:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:43,570 INFO L225 Difference]: With dead ends: 519 [2021-10-05 20:45:43,571 INFO L226 Difference]: Without dead ends: 519 [2021-10-05 20:45:43,571 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-05 20:45:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 449. [2021-10-05 20:45:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 3.359375) internal successors, (1505), 448 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1505 transitions. [2021-10-05 20:45:43,590 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1505 transitions. Word has length 35 [2021-10-05 20:45:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:43,590 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 1505 transitions. [2021-10-05 20:45:43,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1505 transitions. [2021-10-05 20:45:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-05 20:45:43,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:43,593 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:43,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:43,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:43,807 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -324914603, now seen corresponding path program 5 times [2021-10-05 20:45:43,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:43,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436723593] [2021-10-05 20:45:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:43,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-05 20:45:43,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:43,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436723593] [2021-10-05 20:45:43,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436723593] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:43,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701302747] [2021-10-05 20:45:43,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-05 20:45:43,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:43,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:43,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-05 20:45:44,185 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-10-05 20:45:44,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:44,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-05 20:45:44,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-05 20:45:44,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701302747] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:44,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:44,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2021-10-05 20:45:44,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324609737] [2021-10-05 20:45:44,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 20:45:44,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 20:45:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-05 20:45:44,355 INFO L87 Difference]: Start difference. First operand 449 states and 1505 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:44,471 INFO L93 Difference]: Finished difference Result 614 states and 2077 transitions. [2021-10-05 20:45:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 20:45:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-05 20:45:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:44,478 INFO L225 Difference]: With dead ends: 614 [2021-10-05 20:45:44,478 INFO L226 Difference]: Without dead ends: 614 [2021-10-05 20:45:44,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-10-05 20:45:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-10-05 20:45:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 544. [2021-10-05 20:45:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.3701657458563536) internal successors, (1830), 543 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1830 transitions. [2021-10-05 20:45:44,500 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1830 transitions. Word has length 40 [2021-10-05 20:45:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:44,500 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1830 transitions. [2021-10-05 20:45:44,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1830 transitions. [2021-10-05 20:45:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-05 20:45:44,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:44,504 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:44,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:44,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:44,718 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1344035285, now seen corresponding path program 6 times [2021-10-05 20:45:44,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:44,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838670418] [2021-10-05 20:45:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:44,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-05 20:45:44,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:44,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838670418] [2021-10-05 20:45:44,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838670418] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:44,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852857328] [2021-10-05 20:45:44,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-05 20:45:44,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:44,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:44,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-05 20:45:44,983 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-10-05 20:45:44,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:44,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:44,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-05 20:45:45,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852857328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:45,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-05 20:45:45,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-10-05 20:45:45,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914339111] [2021-10-05 20:45:45,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 20:45:45,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:45,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 20:45:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:45,132 INFO L87 Difference]: Start difference. First operand 544 states and 1830 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:45,174 INFO L93 Difference]: Finished difference Result 852 states and 2834 transitions. [2021-10-05 20:45:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-05 20:45:45,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-05 20:45:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:45,183 INFO L225 Difference]: With dead ends: 852 [2021-10-05 20:45:45,183 INFO L226 Difference]: Without dead ends: 852 [2021-10-05 20:45:45,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 48.9ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-10-05 20:45:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 544. [2021-10-05 20:45:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.3701657458563536) internal successors, (1830), 543 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1830 transitions. [2021-10-05 20:45:45,210 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1830 transitions. Word has length 45 [2021-10-05 20:45:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:45,211 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1830 transitions. [2021-10-05 20:45:45,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1830 transitions. [2021-10-05 20:45:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-05 20:45:45,214 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:45,214 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:45,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:45,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:45,428 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash 140858567, now seen corresponding path program 1 times [2021-10-05 20:45:45,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:45,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774831240] [2021-10-05 20:45:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:45,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-05 20:45:45,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:45,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774831240] [2021-10-05 20:45:45,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774831240] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:45,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77220675] [2021-10-05 20:45:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:45,559 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:45,561 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-05 20:45:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:45,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:45,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-05 20:45:45,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77220675] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:45,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:45,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-05 20:45:45,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114133101] [2021-10-05 20:45:45,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 20:45:45,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:45,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 20:45:45,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:45,874 INFO L87 Difference]: Start difference. First operand 544 states and 1830 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:45,957 INFO L93 Difference]: Finished difference Result 660 states and 2238 transitions. [2021-10-05 20:45:45,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 20:45:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-05 20:45:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:45,965 INFO L225 Difference]: With dead ends: 660 [2021-10-05 20:45:45,965 INFO L226 Difference]: Without dead ends: 660 [2021-10-05 20:45:45,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-10-05 20:45:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 636. [2021-10-05 20:45:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.3889763779527557) internal successors, (2152), 635 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2152 transitions. [2021-10-05 20:45:46,002 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2152 transitions. Word has length 46 [2021-10-05 20:45:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:46,002 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 2152 transitions. [2021-10-05 20:45:46,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2152 transitions. [2021-10-05 20:45:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-05 20:45:46,006 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:46,006 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:46,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:46,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:46,220 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1066047943, now seen corresponding path program 2 times [2021-10-05 20:45:46,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:46,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806082116] [2021-10-05 20:45:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:46,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:46,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:46,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806082116] [2021-10-05 20:45:46,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806082116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 20:45:46,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 20:45:46,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-05 20:45:46,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199988449] [2021-10-05 20:45:46,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 20:45:46,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 20:45:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-05 20:45:46,345 INFO L87 Difference]: Start difference. First operand 636 states and 2152 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:46,369 INFO L93 Difference]: Finished difference Result 827 states and 2648 transitions. [2021-10-05 20:45:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 20:45:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-10-05 20:45:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:46,376 INFO L225 Difference]: With dead ends: 827 [2021-10-05 20:45:46,376 INFO L226 Difference]: Without dead ends: 636 [2021-10-05 20:45:46,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-05 20:45:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2021-10-05 20:45:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2021-10-05 20:45:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.222047244094488) internal successors, (2046), 635 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2046 transitions. [2021-10-05 20:45:46,401 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2046 transitions. Word has length 48 [2021-10-05 20:45:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:46,401 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 2046 transitions. [2021-10-05 20:45:46,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2046 transitions. [2021-10-05 20:45:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-05 20:45:46,404 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:46,405 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:46,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 20:45:46,405 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:46,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1123910534, now seen corresponding path program 1 times [2021-10-05 20:45:46,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:46,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558665106] [2021-10-05 20:45:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:46,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:46,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:46,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558665106] [2021-10-05 20:45:46,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558665106] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:46,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127033693] [2021-10-05 20:45:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:46,469 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:46,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:46,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-05 20:45:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:46,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-05 20:45:46,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:46,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127033693] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:46,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:46,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-05 20:45:46,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345191260] [2021-10-05 20:45:46,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 20:45:46,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 20:45:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-05 20:45:46,787 INFO L87 Difference]: Start difference. First operand 636 states and 2046 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:46,837 INFO L93 Difference]: Finished difference Result 1050 states and 3435 transitions. [2021-10-05 20:45:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 20:45:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-10-05 20:45:46,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:46,847 INFO L225 Difference]: With dead ends: 1050 [2021-10-05 20:45:46,848 INFO L226 Difference]: Without dead ends: 1050 [2021-10-05 20:45:46,848 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-05 20:45:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-10-05 20:45:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 848. [2021-10-05 20:45:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 3.2538370720188903) internal successors, (2756), 847 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 2756 transitions. [2021-10-05 20:45:46,885 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 2756 transitions. Word has length 49 [2021-10-05 20:45:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:46,886 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 2756 transitions. [2021-10-05 20:45:46,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 2756 transitions. [2021-10-05 20:45:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-05 20:45:46,890 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:46,890 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:46,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:47,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-05 20:45:47,106 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -145038871, now seen corresponding path program 2 times [2021-10-05 20:45:47,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:47,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778673427] [2021-10-05 20:45:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:47,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:47,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:47,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778673427] [2021-10-05 20:45:47,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778673427] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:47,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142461014] [2021-10-05 20:45:47,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-05 20:45:47,183 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:47,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:47,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:47,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-05 20:45:47,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-05 20:45:47,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:47,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-05 20:45:47,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:47,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142461014] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:47,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:47,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-05 20:45:47,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446672001] [2021-10-05 20:45:47,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 20:45:47,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 20:45:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:47,544 INFO L87 Difference]: Start difference. First operand 848 states and 2756 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:47,590 INFO L93 Difference]: Finished difference Result 1262 states and 4145 transitions. [2021-10-05 20:45:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-05 20:45:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-05 20:45:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:47,603 INFO L225 Difference]: With dead ends: 1262 [2021-10-05 20:45:47,603 INFO L226 Difference]: Without dead ends: 1262 [2021-10-05 20:45:47,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 31.3ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-05 20:45:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2021-10-05 20:45:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1060. [2021-10-05 20:45:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 3.2728989612842305) internal successors, (3466), 1059 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 3466 transitions. [2021-10-05 20:45:47,658 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 3466 transitions. Word has length 51 [2021-10-05 20:45:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:47,658 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 3466 transitions. [2021-10-05 20:45:47,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 3466 transitions. [2021-10-05 20:45:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-05 20:45:47,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:47,663 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:47,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:47,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:47,879 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -47208552, now seen corresponding path program 3 times [2021-10-05 20:45:47,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:47,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459662087] [2021-10-05 20:45:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:47,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:47,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:47,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459662087] [2021-10-05 20:45:47,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459662087] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:47,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174072074] [2021-10-05 20:45:47,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-05 20:45:47,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:47,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:47,971 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:47,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-05 20:45:48,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-05 20:45:48,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:48,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-05 20:45:48,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:48,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174072074] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:48,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:48,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-10-05 20:45:48,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864256429] [2021-10-05 20:45:48,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 20:45:48,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 20:45:48,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-05 20:45:48,547 INFO L87 Difference]: Start difference. First operand 1060 states and 3466 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:48,616 INFO L93 Difference]: Finished difference Result 1474 states and 4855 transitions. [2021-10-05 20:45:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-05 20:45:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-10-05 20:45:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:48,629 INFO L225 Difference]: With dead ends: 1474 [2021-10-05 20:45:48,630 INFO L226 Difference]: Without dead ends: 1474 [2021-10-05 20:45:48,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-05 20:45:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2021-10-05 20:45:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1272. [2021-10-05 20:45:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1271 states have (on average 3.2856018882769473) internal successors, (4176), 1271 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 4176 transitions. [2021-10-05 20:45:48,694 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 4176 transitions. Word has length 53 [2021-10-05 20:45:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:48,694 INFO L470 AbstractCegarLoop]: Abstraction has 1272 states and 4176 transitions. [2021-10-05 20:45:48,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 4176 transitions. [2021-10-05 20:45:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-05 20:45:48,699 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:48,700 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:48,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:48,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-05 20:45:48,914 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -521552505, now seen corresponding path program 4 times [2021-10-05 20:45:48,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:48,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348567412] [2021-10-05 20:45:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:48,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 20:45:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:49,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 20:45:49,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348567412] [2021-10-05 20:45:49,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348567412] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:49,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085298861] [2021-10-05 20:45:49,018 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-05 20:45:49,018 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-05 20:45:49,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 20:45:49,019 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-05 20:45:49,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-05 20:45:49,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-05 20:45:49,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-05 20:45:49,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-05 20:45:49,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-05 20:45:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-05 20:45:49,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085298861] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-05 20:45:49,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-05 20:45:49,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-05 20:45:49,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919273987] [2021-10-05 20:45:49,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 20:45:49,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 20:45:49,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 20:45:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:49,427 INFO L87 Difference]: Start difference. First operand 1272 states and 4176 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 20:45:49,489 INFO L93 Difference]: Finished difference Result 1580 states and 5210 transitions. [2021-10-05 20:45:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 20:45:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-10-05 20:45:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 20:45:49,503 INFO L225 Difference]: With dead ends: 1580 [2021-10-05 20:45:49,503 INFO L226 Difference]: Without dead ends: 1580 [2021-10-05 20:45:49,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 54.9ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-05 20:45:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-10-05 20:45:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1484. [2021-10-05 20:45:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 3.2946729602157787) internal successors, (4886), 1483 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 4886 transitions. [2021-10-05 20:45:49,572 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 4886 transitions. Word has length 55 [2021-10-05 20:45:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 20:45:49,572 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 4886 transitions. [2021-10-05 20:45:49,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 20:45:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 4886 transitions. [2021-10-05 20:45:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-05 20:45:49,578 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 20:45:49,578 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 20:45:49,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-05 20:45:49,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-05 20:45:49,792 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 20:45:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 20:45:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1099557962, now seen corresponding path program 5 times [2021-10-05 20:45:49,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 20:45:49,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956337332] [2021-10-05 20:45:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 20:45:49,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 20:45:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-05 20:45:50,081 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-05 20:45:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-05 20:45:50,374 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-05 20:45:50,374 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-05 20:45:50,376 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 20:45:50,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 20:45:50,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 20:45:50,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 20:45:50,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 20:45:50,388 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 20:45:50,388 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 20:45:50,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 08:45:50 BasicIcfg [2021-10-05 20:45:50,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 20:45:50,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 20:45:50,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 20:45:50,538 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 20:45:50,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 08:45:31" (3/4) ... [2021-10-05 20:45:50,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-05 20:45:50,644 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 20:45:50,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 20:45:50,646 INFO L168 Benchmark]: Toolchain (without parser) took 19814.00 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 30.4 MB in the beginning and 68.4 MB in the end (delta: -38.0 MB). Peak memory consumption was 83.6 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,646 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 41.9 MB. Free memory is still 19.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 20:45:50,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.60 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 32.3 MB in the end (delta: -2.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.29 ms. Allocated memory is still 54.5 MB. Free memory was 32.3 MB in the beginning and 30.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,648 INFO L168 Benchmark]: Boogie Preprocessor took 35.55 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 28.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,648 INFO L168 Benchmark]: RCFGBuilder took 590.47 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 24.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,648 INFO L168 Benchmark]: TraceAbstraction took 18697.45 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 24.1 MB in the beginning and 88.3 MB in the end (delta: -64.3 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,649 INFO L168 Benchmark]: Witness Printer took 106.68 ms. Allocated memory is still 174.1 MB. Free memory was 87.3 MB in the beginning and 68.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-05 20:45:50,651 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 41.9 MB. Free memory is still 19.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.60 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 32.3 MB in the end (delta: -2.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.29 ms. Allocated memory is still 54.5 MB. Free memory was 32.3 MB in the beginning and 30.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.55 ms. Allocated memory is still 54.5 MB. Free memory was 30.2 MB in the beginning and 28.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 590.47 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 24.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18697.45 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 24.1 MB in the beginning and 88.3 MB in the end (delta: -64.3 MB). Peak memory consumption was 76.0 MB. Max. memory is 16.1 GB. * Witness Printer took 106.68 ms. Allocated memory is still 174.1 MB. Free memory was 87.3 MB in the beginning and 68.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7207.5ms, 204 PlacesBefore, 38 PlacesAfterwards, 216 TransitionsBefore, 36 TransitionsAfterwards, 4272 CoEnabledTransitionPairs, 6 FixpointIterations, 110 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 9 ConcurrentYvCompositions, 14 ChoiceCompositions, 218 TotalNumberOfCompositions, 4927 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3770, positive: 3696, positive conditional: 0, positive unconditional: 3696, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2809, positive: 2781, positive conditional: 0, positive unconditional: 2781, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2809, positive: 2781, positive conditional: 0, positive unconditional: 2781, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3770, positive: 915, positive conditional: 0, positive unconditional: 915, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 2809, unknown conditional: 0, unknown unconditional: 2809] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 100]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 int *a1, *a2, *a3; [L39] 0 int res1, res2, res3; [L40] 0 _Bool isNull1, isNull2, isNull3; [L82] 0 pthread_t t1, t2, t3; [L35] COND FALSE 0 !(!cond) [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L84] 0 a1 = create_fresh_int_array(5) [L35] COND FALSE 0 !(!cond) [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L85] 0 a2 = create_fresh_int_array(5) [L35] COND FALSE 0 !(!cond) [L106] 0 int* arr = (int*)malloc(sizeof(int) * size); [L107] 0 int i = 0; VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND TRUE 0 i < size [L108] 0 arr[i] = __VERIFIER_nondet_int() [L107] 0 i++ VAL [a1={6:0}, a2={-8:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L107] COND FALSE 0 !(i < size) [L110] 0 return arr; [L86] 0 a3 = create_fresh_int_array(5) [L87] 0 isNull1 = __VERIFIER_nondet_bool() [L88] 0 isNull2 = __VERIFIER_nondet_bool() [L89] 0 isNull3 = __VERIFIER_nondet_bool() [L92] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=0, res2=0, res3=0] [L45] 1 int i = 0; [L35] COND FALSE 1 !(!cond) [L47] 1 res1 = 1 VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 res1 = a1[i] - a2[i] [L50] COND FALSE 1 !(res1 == 0) [L53] 1 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=33, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=33, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 res1 = a1[i] - a2[i] [L50] COND FALSE 1 !(res1 == 0) [L53] 1 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=4, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=4, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 res1 = a1[i] - a2[i] [L50] COND FALSE 1 !(res1 == 0) [L53] 1 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=-3, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=-3, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 res1 = a1[i] - a2[i] [L50] COND FALSE 1 !(res1 == 0) [L53] 1 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L48] COND TRUE 1 !isNull2 && i < 5 [L49] EXPR 1 a1[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L49] EXPR 1 a2[i] [L49] 1 res1 = a1[i] - a2[i] [L50] COND FALSE 1 !(res1 == 0) [L53] 1 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L48] COND FALSE 1 !(!isNull2 && i < 5) [L93] FCALL, FORK 0 pthread_create(&t2, NULL, thread2, NULL) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L58] 2 int i = 0; [L35] COND FALSE 2 !(!cond) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L60] COND TRUE 2 !isNull3 && i < 5 [L61] EXPR 2 a2[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=0, res3=0] [L61] EXPR 2 a3[i] [L61] 2 res2 = a2[i] - a3[i] [L62] COND FALSE 2 !(res2 == 0) [L65] 2 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=-33, res3=0] [L60] COND TRUE 2 !isNull3 && i < 5 [L61] EXPR 2 a2[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=-33, res3=0] [L61] EXPR 2 a3[i] [L61] 2 res2 = a2[i] - a3[i] [L62] COND FALSE 2 !(res2 == 0) [L65] 2 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L60] COND TRUE 2 !isNull3 && i < 5 [L61] EXPR 2 a2[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L61] EXPR 2 a3[i] [L61] 2 res2 = a2[i] - a3[i] [L62] COND FALSE 2 !(res2 == 0) [L65] 2 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L60] COND TRUE 2 !isNull3 && i < 5 [L61] EXPR 2 a2[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L61] EXPR 2 a3[i] [L61] 2 res2 = a2[i] - a3[i] [L62] COND FALSE 2 !(res2 == 0) [L65] 2 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L60] COND TRUE 2 !isNull3 && i < 5 [L61] EXPR 2 a2[i] VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=24, res3=0] [L61] EXPR 2 a3[i] [L61] 2 res2 = a2[i] - a3[i] [L62] COND FALSE 2 !(res2 == 0) [L65] 2 i++ VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L60] COND FALSE 2 !(!isNull3 && i < 5) [L94] FCALL, FORK 0 pthread_create(&t3, NULL, thread3, NULL) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L95] 0 \read(t1) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L95] FCALL, JOIN 1 pthread_join(t1, 0) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L70] 3 int i = 0; [L35] COND FALSE 3 !(!cond) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L96] 0 \read(t2) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L96] FCALL, JOIN 2 pthread_join(t2, 0) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L97] 0 \read(t3) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L72] COND TRUE 3 !isNull3 && i < 5 [L73] EXPR 3 a1[i] [L73] EXPR 3 a3[i] [L73] 3 res3 = a1[i] - a3[i] [L74] COND TRUE 3 res3 == 0 [L97] FCALL, JOIN 3 pthread_join(t3, 0) VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] [L35] COND FALSE 0 !(!cond) [L100] 0 reach_error() VAL [a1={6:0}, a2={-8:0}, a3={7:0}, isNull1=512, isNull2=768, isNull3=256, res1=1, res2=1, res3=0] - UnprovableResult [Line: 94]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 253 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 18346.7ms, OverallIterations: 16, TraceHistogramMax: 5, EmptinessCheckTime: 66.4ms, AutomataDifference: 1067.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7286.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 672 SDtfs, 853 SDslu, 1608 SDs, 0 SdLazy, 468 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 454.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 505 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 523.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1484occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 502.4ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1882 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 318.0ms SsaConstructionTime, 1792.6ms SatisfiabilityAnalysisTime, 2776.0ms InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1096 ConstructedInterpolants, 0 QuantifiedInterpolants, 2278 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3969 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 1034/1188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-05 20:45:50,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...