./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:07:59,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:07:59,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:07:59,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:07:59,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:07:59,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:07:59,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:07:59,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:07:59,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:07:59,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:07:59,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:07:59,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:07:59,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:07:59,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:07:59,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:07:59,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:07:59,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:07:59,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:07:59,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:07:59,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:07:59,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:07:59,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:07:59,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:07:59,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:07:59,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:07:59,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:07:59,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:07:59,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:07:59,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:07:59,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:07:59,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:07:59,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:07:59,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:07:59,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:07:59,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:07:59,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:07:59,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:07:59,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:07:59,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:07:59,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:07:59,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:07:59,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:07:59,414 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:07:59,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:07:59,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:07:59,415 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:07:59,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:07:59,415 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:07:59,416 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:07:59,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:07:59,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:07:59,417 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:07:59,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:07:59,422 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:07:59,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:07:59,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:07:59,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:07:59,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:07:59,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:07:59,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:07:59,423 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:07:59,424 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:07:59,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:07:59,424 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:07:59,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:07:59,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:07:59,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:07:59,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:07:59,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:07:59,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:07:59,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:07:59,427 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:07:59,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:07:59,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:07:59,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:07:59,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:07:59,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH 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 -> Taipan 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2021-11-03 05:07:59,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:07:59,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:07:59,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:07:59,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:07:59,722 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:07:59,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/pthread/stack-1.i [2021-11-03 05:07:59,784 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/data/bdc78edde/162742c3413a47ab853873d1cafd8117/FLAG21db5b575 [2021-11-03 05:08:00,361 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:08:00,361 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/sv-benchmarks/c/pthread/stack-1.i [2021-11-03 05:08:00,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/data/bdc78edde/162742c3413a47ab853873d1cafd8117/FLAG21db5b575 [2021-11-03 05:08:00,622 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/data/bdc78edde/162742c3413a47ab853873d1cafd8117 [2021-11-03 05:08:00,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:08:00,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:08:00,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:08:00,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:08:00,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:08:00,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:08:00" (1/1) ... [2021-11-03 05:08:00,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286afc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:00, skipping insertion in model container [2021-11-03 05:08:00,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:08:00" (1/1) ... [2021-11-03 05:08:00,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:08:00,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:08:01,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-03 05:08:01,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:08:01,209 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:08:01,272 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2021-11-03 05:08:01,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:08:01,366 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:08:01,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01 WrapperNode [2021-11-03 05:08:01,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:08:01,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:08:01,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:08:01,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:08:01,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:08:01,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:08:01,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:08:01,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:08:01,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:08:01,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:08:01,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:08:01,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:08:01,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (1/1) ... [2021-11-03 05:08:01,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:08:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:01,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:08:01,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:08:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-03 05:08:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-03 05:08:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-03 05:08:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-03 05:08:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:08:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:08:01,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:08:01,539 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 05:08:02,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:08:02,026 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-11-03 05:08:02,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:08:02 BoogieIcfgContainer [2021-11-03 05:08:02,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:08:02,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:08:02,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:08:02,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:08:02,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:08:00" (1/3) ... [2021-11-03 05:08:02,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd64a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:08:02, skipping insertion in model container [2021-11-03 05:08:02,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:08:01" (2/3) ... [2021-11-03 05:08:02,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd64a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:08:02, skipping insertion in model container [2021-11-03 05:08:02,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:08:02" (3/3) ... [2021-11-03 05:08:02,037 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2021-11-03 05:08:02,042 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 05:08:02,042 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:08:02,042 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-03 05:08:02,043 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 05:08:02,079 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,079 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,080 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,080 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,080 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,080 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,080 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,081 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,081 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,081 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,081 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,082 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,082 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,082 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,082 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,096 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,097 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,097 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,097 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,097 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,098 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,098 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,099 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,100 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,101 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,101 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,101 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,101 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,102 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,102 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,102 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,103 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,103 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,103 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,103 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,106 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,106 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,107 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,107 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,107 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,107 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,108 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,109 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,110 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,111 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,112 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,113 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,114 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,115 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,116 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,117 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,118 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,118 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,119 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,120 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,121 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,122 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,123 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,124 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,125 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,126 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,127 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,128 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,129 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,130 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,131 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,131 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,131 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,131 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,131 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,132 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,133 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,133 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,133 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,133 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,133 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,134 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,134 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,134 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,134 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,134 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,135 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,136 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,136 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,136 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,136 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,136 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,137 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,138 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,139 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,139 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,139 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,139 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,139 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,140 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,140 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,140 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,141 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,144 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,144 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,145 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,146 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,147 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,152 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,152 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,153 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,154 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,155 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,155 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 05:08:02,162 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-03 05:08:02,217 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:08:02,222 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, mAutomataTypeConcurrency=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-11-03 05:08:02,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-03 05:08:02,236 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 05:08:02,247 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 152 transitions, 320 flow [2021-11-03 05:08:02,249 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 152 transitions, 320 flow [2021-11-03 05:08:02,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 152 transitions, 320 flow [2021-11-03 05:08:02,320 INFO L129 PetriNetUnfolder]: 10/150 cut-off events. [2021-11-03 05:08:02,320 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-03 05:08:02,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 150 events. 10/150 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 334 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2021-11-03 05:08:02,333 INFO L116 LiptonReduction]: Number of co-enabled transitions 6156 [2021-11-03 05:08:09,862 INFO L131 LiptonReduction]: Checked pairs total: 8550 [2021-11-03 05:08:09,863 INFO L133 LiptonReduction]: Total number of compositions: 142 [2021-11-03 05:08:09,870 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 88 flow [2021-11-03 05:08:09,922 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 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-11-03 05:08:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 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-11-03 05:08:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:08:09,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:09,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:08:09,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1203272477, now seen corresponding path program 1 times [2021-11-03 05:08:09,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:09,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115557205] [2021-11-03 05:08:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:09,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:10,232 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:10,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115557205] [2021-11-03 05:08:10,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115557205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:10,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:10,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:08:10,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890810043] [2021-11-03 05:08:10,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:08:10,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:08:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:10,265 INFO L87 Difference]: Start difference. First operand has 282 states, 279 states have (on average 2.6917562724014337) internal successors, (751), 281 states have internal predecessors, (751), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-03 05:08:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:10,336 INFO L93 Difference]: Finished difference Result 414 states and 1064 transitions. [2021-11-03 05:08:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:08:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2021-11-03 05:08:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:10,369 INFO L225 Difference]: With dead ends: 414 [2021-11-03 05:08:10,369 INFO L226 Difference]: Without dead ends: 396 [2021-11-03 05:08:10,370 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-03 05:08:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 372. [2021-11-03 05:08:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.6856368563685638) internal successors, (991), 371 states have internal predecessors, (991), 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-11-03 05:08:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 991 transitions. [2021-11-03 05:08:10,449 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 991 transitions. Word has length 6 [2021-11-03 05:08:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:10,450 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 991 transitions. [2021-11-03 05:08:10,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-03 05:08:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 991 transitions. [2021-11-03 05:08:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:08:10,451 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:10,452 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:10,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:08:10,452 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1812969123, now seen corresponding path program 1 times [2021-11-03 05:08:10,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:10,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501214193] [2021-11-03 05:08:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:10,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:10,528 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:10,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501214193] [2021-11-03 05:08:10,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501214193] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:10,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:10,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:08:10,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374817619] [2021-11-03 05:08:10,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:08:10,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:08:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:10,531 INFO L87 Difference]: Start difference. First operand 372 states and 991 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 05:08:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:10,562 INFO L93 Difference]: Finished difference Result 410 states and 1089 transitions. [2021-11-03 05:08:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:08:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2021-11-03 05:08:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:10,573 INFO L225 Difference]: With dead ends: 410 [2021-11-03 05:08:10,573 INFO L226 Difference]: Without dead ends: 410 [2021-11-03 05:08:10,574 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-03 05:08:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-03 05:08:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 407 states have (on average 2.675675675675676) internal successors, (1089), 409 states have internal predecessors, (1089), 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-11-03 05:08:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1089 transitions. [2021-11-03 05:08:10,617 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1089 transitions. Word has length 10 [2021-11-03 05:08:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:10,617 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 1089 transitions. [2021-11-03 05:08:10,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-11-03 05:08:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1089 transitions. [2021-11-03 05:08:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:08:10,620 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:10,620 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:10,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:08:10,621 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 951073680, now seen corresponding path program 1 times [2021-11-03 05:08:10,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:10,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024400919] [2021-11-03 05:08:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:10,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:10,768 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:10,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024400919] [2021-11-03 05:08:10,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024400919] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:10,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833921686] [2021-11-03 05:08:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:10,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:10,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:08:10,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:08:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:10,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 05:08:10,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:08:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:10,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:08:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:11,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833921686] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:08:11,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131951255] [2021-11-03 05:08:11,060 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:08:11,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:08:11,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-03 05:08:11,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956180741] [2021-11-03 05:08:11,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 05:08:11,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:11,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 05:08:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-03 05:08:11,066 INFO L87 Difference]: Start difference. First operand 410 states and 1089 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 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-11-03 05:08:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:11,277 INFO L93 Difference]: Finished difference Result 998 states and 2565 transitions. [2021-11-03 05:08:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:08:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 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 13 [2021-11-03 05:08:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:11,290 INFO L225 Difference]: With dead ends: 998 [2021-11-03 05:08:11,290 INFO L226 Difference]: Without dead ends: 986 [2021-11-03 05:08:11,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-11-03 05:08:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-11-03 05:08:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 678. [2021-11-03 05:08:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 675 states have (on average 2.6977777777777776) internal successors, (1821), 677 states have internal predecessors, (1821), 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-11-03 05:08:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1821 transitions. [2021-11-03 05:08:11,327 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1821 transitions. Word has length 13 [2021-11-03 05:08:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:11,328 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1821 transitions. [2021-11-03 05:08:11,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 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-11-03 05:08:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1821 transitions. [2021-11-03 05:08:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:08:11,336 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:11,336 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:11,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:08:11,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:11,550 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash 158671420, now seen corresponding path program 1 times [2021-11-03 05:08:11,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:11,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688704086] [2021-11-03 05:08:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:11,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:11,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:11,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688704086] [2021-11-03 05:08:11,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688704086] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:11,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:11,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:08:11,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707109537] [2021-11-03 05:08:11,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:08:11,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:08:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:11,645 INFO L87 Difference]: Start difference. First operand 678 states and 1821 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-03 05:08:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:11,667 INFO L93 Difference]: Finished difference Result 300 states and 681 transitions. [2021-11-03 05:08:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:08:11,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-11-03 05:08:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:11,671 INFO L225 Difference]: With dead ends: 300 [2021-11-03 05:08:11,671 INFO L226 Difference]: Without dead ends: 300 [2021-11-03 05:08:11,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-03 05:08:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2021-11-03 05:08:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.25) internal successors, (630), 281 states have internal predecessors, (630), 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-11-03 05:08:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 630 transitions. [2021-11-03 05:08:11,686 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 630 transitions. Word has length 16 [2021-11-03 05:08:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:11,687 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 630 transitions. [2021-11-03 05:08:11,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-03 05:08:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 630 transitions. [2021-11-03 05:08:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 05:08:11,688 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:11,688 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:11,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:08:11,689 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1994162131, now seen corresponding path program 1 times [2021-11-03 05:08:11,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:11,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055670640] [2021-11-03 05:08:11,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:11,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:11,743 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:11,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055670640] [2021-11-03 05:08:11,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055670640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:11,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:11,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:08:11,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701971512] [2021-11-03 05:08:11,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:08:11,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:08:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:11,746 INFO L87 Difference]: Start difference. First operand 282 states and 630 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-03 05:08:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:11,780 INFO L93 Difference]: Finished difference Result 340 states and 756 transitions. [2021-11-03 05:08:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:08:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2021-11-03 05:08:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:11,784 INFO L225 Difference]: With dead ends: 340 [2021-11-03 05:08:11,784 INFO L226 Difference]: Without dead ends: 340 [2021-11-03 05:08:11,784 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:08:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-03 05:08:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2021-11-03 05:08:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 282 states have (on average 2.2588652482269502) internal successors, (637), 283 states have internal predecessors, (637), 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-11-03 05:08:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2021-11-03 05:08:11,796 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2021-11-03 05:08:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:11,798 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2021-11-03 05:08:11,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-03 05:08:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2021-11-03 05:08:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 05:08:11,799 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:11,800 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:11,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:08:11,800 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1375844924, now seen corresponding path program 1 times [2021-11-03 05:08:11,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:11,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811842446] [2021-11-03 05:08:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:11,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:12,385 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:12,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811842446] [2021-11-03 05:08:12,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811842446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:12,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:12,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-03 05:08:12,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564059835] [2021-11-03 05:08:12,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 05:08:12,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:12,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 05:08:12,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:08:12,388 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-11-03 05:08:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:13,397 INFO L93 Difference]: Finished difference Result 531 states and 1147 transitions. [2021-11-03 05:08:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 05:08:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 21 [2021-11-03 05:08:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:13,401 INFO L225 Difference]: With dead ends: 531 [2021-11-03 05:08:13,402 INFO L226 Difference]: Without dead ends: 474 [2021-11-03 05:08:13,402 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2021-11-03 05:08:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-03 05:08:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 346. [2021-11-03 05:08:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 2.2674418604651163) internal successors, (780), 345 states have internal predecessors, (780), 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-11-03 05:08:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 780 transitions. [2021-11-03 05:08:13,417 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 780 transitions. Word has length 21 [2021-11-03 05:08:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:13,418 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 780 transitions. [2021-11-03 05:08:13,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-11-03 05:08:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 780 transitions. [2021-11-03 05:08:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 05:08:13,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:13,420 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:13,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:08:13,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash 949323480, now seen corresponding path program 2 times [2021-11-03 05:08:13,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:13,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501504318] [2021-11-03 05:08:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:13,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:14,043 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:14,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501504318] [2021-11-03 05:08:14,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501504318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:14,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:14,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-03 05:08:14,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307763987] [2021-11-03 05:08:14,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 05:08:14,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:14,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 05:08:14,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:08:14,046 INFO L87 Difference]: Start difference. First operand 346 states and 780 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-11-03 05:08:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:14,861 INFO L93 Difference]: Finished difference Result 557 states and 1214 transitions. [2021-11-03 05:08:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:08:14,862 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 [2021-11-03 05:08:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:14,865 INFO L225 Difference]: With dead ends: 557 [2021-11-03 05:08:14,865 INFO L226 Difference]: Without dead ends: 512 [2021-11-03 05:08:14,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-11-03 05:08:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-03 05:08:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 376. [2021-11-03 05:08:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 2.2566844919786098) internal successors, (844), 375 states have internal predecessors, (844), 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-11-03 05:08:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 844 transitions. [2021-11-03 05:08:14,881 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 844 transitions. Word has length 21 [2021-11-03 05:08:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:14,881 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 844 transitions. [2021-11-03 05:08:14,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-11-03 05:08:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 844 transitions. [2021-11-03 05:08:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 05:08:14,883 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:14,883 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:14,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:08:14,883 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -715008454, now seen corresponding path program 3 times [2021-11-03 05:08:14,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:14,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467479700] [2021-11-03 05:08:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:14,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:15,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:15,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467479700] [2021-11-03 05:08:15,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467479700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:08:15,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:08:15,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-03 05:08:15,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052973402] [2021-11-03 05:08:15,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 05:08:15,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:15,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 05:08:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:08:15,379 INFO L87 Difference]: Start difference. First operand 376 states and 844 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-11-03 05:08:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:16,487 INFO L93 Difference]: Finished difference Result 628 states and 1347 transitions. [2021-11-03 05:08:16,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-03 05:08:16,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 [2021-11-03 05:08:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:16,492 INFO L225 Difference]: With dead ends: 628 [2021-11-03 05:08:16,492 INFO L226 Difference]: Without dead ends: 570 [2021-11-03 05:08:16,493 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2021-11-03 05:08:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-11-03 05:08:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 334. [2021-11-03 05:08:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 332 states have (on average 2.253012048192771) internal successors, (748), 333 states have internal predecessors, (748), 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-11-03 05:08:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 748 transitions. [2021-11-03 05:08:16,507 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 748 transitions. Word has length 21 [2021-11-03 05:08:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:16,508 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 748 transitions. [2021-11-03 05:08:16,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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-11-03 05:08:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 748 transitions. [2021-11-03 05:08:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-03 05:08:16,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:16,510 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-11-03 05:08:16,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:08:16,510 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2120212752, now seen corresponding path program 2 times [2021-11-03 05:08:16,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:16,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754413290] [2021-11-03 05:08:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:16,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:16,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:16,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754413290] [2021-11-03 05:08:16,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754413290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:16,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892067880] [2021-11-03 05:08:16,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:08:16,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:16,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:08:16,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:08:16,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-03 05:08:16,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:08:16,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-03 05:08:16,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:08:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:16,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:08:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:16,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892067880] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:08:16,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311595916] [2021-11-03 05:08:16,999 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:08:17,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:08:17,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-11-03 05:08:17,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556805216] [2021-11-03 05:08:17,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:08:17,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:08:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-03 05:08:17,003 INFO L87 Difference]: Start difference. First operand 334 states and 748 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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-11-03 05:08:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:17,134 INFO L93 Difference]: Finished difference Result 666 states and 1428 transitions. [2021-11-03 05:08:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:08:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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 27 [2021-11-03 05:08:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:17,142 INFO L225 Difference]: With dead ends: 666 [2021-11-03 05:08:17,142 INFO L226 Difference]: Without dead ends: 666 [2021-11-03 05:08:17,143 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-11-03 05:08:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-11-03 05:08:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 446. [2021-11-03 05:08:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 2.2567567567567566) internal successors, (1002), 445 states have internal predecessors, (1002), 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-11-03 05:08:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1002 transitions. [2021-11-03 05:08:17,162 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1002 transitions. Word has length 27 [2021-11-03 05:08:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:17,163 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1002 transitions. [2021-11-03 05:08:17,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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-11-03 05:08:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1002 transitions. [2021-11-03 05:08:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 05:08:17,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:17,165 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:17,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:08:17,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-03 05:08:17,378 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1554514995, now seen corresponding path program 4 times [2021-11-03 05:08:17,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:17,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881626317] [2021-11-03 05:08:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:17,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:17,848 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:17,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881626317] [2021-11-03 05:08:17,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881626317] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:17,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218143868] [2021-11-03 05:08:17,848 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:08:17,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:17,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:08:17,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 05:08:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:17,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-03 05:08:18,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:08:18,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-11-03 05:08:18,581 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-11-03 05:08:18,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2021-11-03 05:08:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:18,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:08:18,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-03 05:08:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:08:19,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218143868] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:19,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-03 05:08:19,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 14] total 29 [2021-11-03 05:08:19,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052542218] [2021-11-03 05:08:19,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:08:19,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:08:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:08:19,084 INFO L87 Difference]: Start difference. First operand 446 states and 1002 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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-11-03 05:08:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:20,325 INFO L93 Difference]: Finished difference Result 979 states and 2173 transitions. [2021-11-03 05:08:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-03 05:08:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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 28 [2021-11-03 05:08:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:20,333 INFO L225 Difference]: With dead ends: 979 [2021-11-03 05:08:20,333 INFO L226 Difference]: Without dead ends: 979 [2021-11-03 05:08:20,334 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1949, Unknown=0, NotChecked=0, Total=2162 [2021-11-03 05:08:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-11-03 05:08:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 594. [2021-11-03 05:08:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 592 states have (on average 2.33277027027027) internal successors, (1381), 593 states have internal predecessors, (1381), 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-11-03 05:08:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1381 transitions. [2021-11-03 05:08:20,383 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1381 transitions. Word has length 28 [2021-11-03 05:08:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:20,384 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 1381 transitions. [2021-11-03 05:08:20,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 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-11-03 05:08:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1381 transitions. [2021-11-03 05:08:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 05:08:20,385 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:20,388 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:20,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:08:20,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:20,610 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 363622917, now seen corresponding path program 5 times [2021-11-03 05:08:20,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:20,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881921976] [2021-11-03 05:08:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:20,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:21,179 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:21,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881921976] [2021-11-03 05:08:21,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881921976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:21,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258657258] [2021-11-03 05:08:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:08:21,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:21,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:08:21,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 05:08:21,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-03 05:08:21,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:08:21,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-03 05:08:21,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:08:21,415 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-03 05:08:21,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3398 treesize of output 3134 [2021-11-03 05:08:22,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-03 05:08:22,219 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-03 05:08:22,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 42 [2021-11-03 05:08:22,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 36 [2021-11-03 05:08:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:08:22,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:08:34,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2021-11-03 05:08:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:08:34,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258657258] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:08:34,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1939469234] [2021-11-03 05:08:34,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:08:34,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:08:34,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 39 [2021-11-03 05:08:34,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915766988] [2021-11-03 05:08:34,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-03 05:08:34,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:08:34,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-03 05:08:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1512, Unknown=7, NotChecked=0, Total=1640 [2021-11-03 05:08:34,482 INFO L87 Difference]: Start difference. First operand 594 states and 1381 transitions. Second operand has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 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-11-03 05:08:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:08:40,516 INFO L93 Difference]: Finished difference Result 1087 states and 2392 transitions. [2021-11-03 05:08:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-03 05:08:40,517 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 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-11-03 05:08:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:08:40,524 INFO L225 Difference]: With dead ends: 1087 [2021-11-03 05:08:40,525 INFO L226 Difference]: Without dead ends: 1087 [2021-11-03 05:08:40,527 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=834, Invalid=6131, Unknown=7, NotChecked=0, Total=6972 [2021-11-03 05:08:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2021-11-03 05:08:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 566. [2021-11-03 05:08:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 564 states have (on average 2.3120567375886525) internal successors, (1304), 565 states have internal predecessors, (1304), 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-11-03 05:08:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1304 transitions. [2021-11-03 05:08:40,551 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1304 transitions. Word has length 28 [2021-11-03 05:08:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:08:40,552 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 1304 transitions. [2021-11-03 05:08:40,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.8) internal successors, (72), 40 states have internal predecessors, (72), 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-11-03 05:08:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1304 transitions. [2021-11-03 05:08:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 05:08:40,554 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:08:40,554 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:08:40,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:08:40,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-03 05:08:40,774 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:08:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:08:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 142621127, now seen corresponding path program 1 times [2021-11-03 05:08:40,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:08:40,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046383517] [2021-11-03 05:08:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:40,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:08:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:41,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:08:41,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046383517] [2021-11-03 05:08:41,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046383517] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:08:41,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302307411] [2021-11-03 05:08:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:08:41,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:08:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:08:41,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:08:41,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 05:08:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:08:41,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-03 05:08:41,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:08:41,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-03 05:08:42,317 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-03 05:08:42,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-03 05:08:43,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-03 05:08:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:08:43,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:08:45,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) is different from false [2021-11-03 05:09:04,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-03 05:09:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-03 05:09:04,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302307411] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:09:04,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412046660] [2021-11-03 05:09:05,000 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:09:05,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:09:05,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 52 [2021-11-03 05:09:05,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048653260] [2021-11-03 05:09:05,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-03 05:09:05,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:09:05,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-03 05:09:05,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2486, Unknown=1, NotChecked=100, Total=2756 [2021-11-03 05:09:05,005 INFO L87 Difference]: Start difference. First operand 566 states and 1304 transitions. Second operand has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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-11-03 05:09:07,863 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse2 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse2 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= .cse1 4) (<= c_~top~0 1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-03 05:09:12,019 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse2 (select .cse3 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= c_~top~0 2) (<= 0 .cse1) (< .cse0 4294967296) (<= 0 .cse2) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:09:14,191 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= 0 .cse0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:09:19,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= 0 .cse1) (< .cse0 4294967296) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:09:22,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse3 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse3 0)) (.cse2 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_~top~0 1) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= .cse1 4) (<= c_~top~0 1) (= c_t2Thread1of1ForFork1_pop_~stack.offset 0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)) (<= .cse2 4)))) is different from false [2021-11-03 05:09:24,341 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse5 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse3 (select .cse4 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (<= 0 .cse0) (< .cse0 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:09:28,279 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse2 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (< .cse0 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= 0 .cse1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:09:30,450 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse3 (select .cse4 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_60| Int)) (or (< |v_t1Thread1of1ForFork0_get_top_#res_60| c_~top~0) (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_60| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (< .cse0 4294967296) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:09:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:09:30,492 INFO L93 Difference]: Finished difference Result 2278 states and 5060 transitions. [2021-11-03 05:09:30,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-03 05:09:30,493 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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 36 [2021-11-03 05:09:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:09:30,506 INFO L225 Difference]: With dead ends: 2278 [2021-11-03 05:09:30,507 INFO L226 Difference]: Without dead ends: 2169 [2021-11-03 05:09:30,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 44.8s TimeCoverageRelationStatistics Valid=1003, Invalid=8924, Unknown=9, NotChecked=1836, Total=11772 [2021-11-03 05:09:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2021-11-03 05:09:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 1128. [2021-11-03 05:09:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1126 states have (on average 2.4094138543516874) internal successors, (2713), 1127 states have internal predecessors, (2713), 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-11-03 05:09:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2713 transitions. [2021-11-03 05:09:30,559 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2713 transitions. Word has length 36 [2021-11-03 05:09:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:09:30,559 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 2713 transitions. [2021-11-03 05:09:30,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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-11-03 05:09:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2713 transitions. [2021-11-03 05:09:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 05:09:30,563 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:09:30,563 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:09:30,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 05:09:30,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:09:30,778 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:09:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:09:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1081679627, now seen corresponding path program 2 times [2021-11-03 05:09:30,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:09:30,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109200367] [2021-11-03 05:09:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:09:30,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:09:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:09:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:09:31,460 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:09:31,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109200367] [2021-11-03 05:09:31,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109200367] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:09:31,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062415810] [2021-11-03 05:09:31,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:09:31,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:09:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:09:31,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:09:31,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 05:09:31,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-03 05:09:31,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:09:31,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-03 05:09:31,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:09:32,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-03 05:09:32,417 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-03 05:09:32,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-03 05:09:33,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-03 05:10:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:03,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:10:06,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) is different from false [2021-11-03 05:10:32,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-03 05:10:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-03 05:10:32,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062415810] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:10:32,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335438954] [2021-11-03 05:10:32,672 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:10:32,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:10:32,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 52 [2021-11-03 05:10:32,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749463962] [2021-11-03 05:10:32,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-03 05:10:32,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-03 05:10:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2484, Unknown=16, NotChecked=100, Total=2756 [2021-11-03 05:10:32,677 INFO L87 Difference]: Start difference. First operand 1128 states and 2713 transitions. Second operand has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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-11-03 05:10:36,360 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse0 (select .cse3 0)) (.cse2 (select (store .cse3 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse0 2147483647) (<= .cse2 2147483647) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse1) (<= c_~top~0 1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-03 05:10:39,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse0 2147483647) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse1) (<= c_~top~0 1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-03 05:10:44,706 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse1 (select .cse3 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (<= .cse1 2147483647) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse2) (< .cse0 4294967296) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:10:51,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:10:53,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:11:00,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse1) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:11:10,051 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base)) (.cse7 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse0 (select .cse7 0)) (.cse3 (select (store .cse7 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse6 0)) (.cse4 (select .cse6 (+ .cse5 c_t2Thread1of1ForFork1_pop_~stack.offset (- 4)))) (.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse5 (- 4))))) (and (<= 0 .cse0) (<= .cse1 2147483647) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (< .cse2 4294967296) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (<= .cse0 2147483647) (<= .cse3 2147483647) (= c_~top~0 1) (<= 0 .cse4) (< (div .cse4 (- 4294967296)) (+ (div (+ 4 (* .cse4 (- 1))) 4294967296) 1)) (<= 0 .cse1) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< .cse4 4294967296) (<= 0 .cse2) (<= c_~top~0 1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (= c_t2Thread1of1ForFork1_pop_~stack.offset 0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-03 05:11:12,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse5 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (<= .cse0 2147483647) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (<= .cse3 2147483647) (<= 0 .cse1) (< .cse1 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse2) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:11:14,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse0 (select .cse3 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (<= .cse0 2147483647) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 2147483647) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse1) (<= c_~top~0 1) (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:11:28,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse2 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (< .cse0 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:11:31,619 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse1 (select .cse4 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (<= .cse1 2147483647) (< .cse2 4294967296) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (<= .cse3 2147483647) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse2) (<= c_~top~0 1) (< .cse0 4294967296) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_64| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_64| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_64| c_~top~0))) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:11:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:34,556 INFO L93 Difference]: Finished difference Result 3125 states and 6907 transitions. [2021-11-03 05:11:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-11-03 05:11:34,557 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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 36 [2021-11-03 05:11:34,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:34,574 INFO L225 Difference]: With dead ends: 3125 [2021-11-03 05:11:34,574 INFO L226 Difference]: Without dead ends: 2969 [2021-11-03 05:11:34,580 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 4229 ImplicationChecksByTransitivity, 116.5s TimeCoverageRelationStatistics Valid=1472, Invalid=15841, Unknown=27, NotChecked=3252, Total=20592 [2021-11-03 05:11:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2021-11-03 05:11:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1239. [2021-11-03 05:11:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 2.469684721099434) internal successors, (3055), 1238 states have internal predecessors, (3055), 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-11-03 05:11:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 3055 transitions. [2021-11-03 05:11:34,638 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 3055 transitions. Word has length 36 [2021-11-03 05:11:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:34,638 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 3055 transitions. [2021-11-03 05:11:34,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 53 states have internal predecessors, (102), 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-11-03 05:11:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 3055 transitions. [2021-11-03 05:11:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 05:11:34,642 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:34,642 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:34,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:34,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:34,858 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:11:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1476713409, now seen corresponding path program 3 times [2021-11-03 05:11:34,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:34,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378263457] [2021-11-03 05:11:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:34,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:35,652 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:35,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378263457] [2021-11-03 05:11:35,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378263457] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:35,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941262907] [2021-11-03 05:11:35,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-03 05:11:35,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:35,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:35,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 05:11:36,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-03 05:11:36,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:11:36,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-03 05:11:36,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:36,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-03 05:11:36,763 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-03 05:11:36,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-03 05:11:37,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-03 05:11:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:47,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:50,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) is different from false [2021-11-03 05:12:20,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-03 05:12:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-03 05:12:20,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941262907] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:12:20,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398414334] [2021-11-03 05:12:20,885 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:12:20,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:12:20,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 53 [2021-11-03 05:12:20,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584665047] [2021-11-03 05:12:20,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-11-03 05:12:20,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:12:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-11-03 05:12:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2581, Unknown=6, NotChecked=102, Total=2862 [2021-11-03 05:12:20,889 INFO L87 Difference]: Start difference. First operand 1239 states and 3055 transitions. Second operand has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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-11-03 05:12:31,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse2 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse2 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= .cse1 4) (<= c_~top~0 1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-03 05:12:36,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) 0))) (and (<= 0 .cse0) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= c_~top~0 1) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-03 05:13:32,790 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse2 (select .cse3 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse1) (< .cse0 4294967296) (<= 0 .cse2) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:13:39,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:13:43,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse0) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:14:42,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse1) (< .cse0 4294967296) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:15:10,443 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse3 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse3 0)) (.cse2 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_~top~0 1) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= 0 .cse2) (<= .cse1 4) (<= c_~top~0 1) (= c_t2Thread1of1ForFork1_pop_~stack.offset 0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)) (<= .cse2 4)))) is different from false [2021-11-03 05:15:12,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse5 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse3 (select .cse4 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (<= 0 .cse0) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:15:19,389 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse2 (select .cse3 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= .cse1 4) (<= 0 .cse0) (<= c_~top~0 1) (<= 0 .cse2) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:16:00,243 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse2 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (<= 0 .cse1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:16:15,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse3 (select .cse4 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_68| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_68| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_get_top_#res_68| c_~top~0))) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (< .cse0 4294967296) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:16:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:16:47,021 INFO L93 Difference]: Finished difference Result 3663 states and 8224 transitions. [2021-11-03 05:16:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-03 05:16:47,022 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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 36 [2021-11-03 05:16:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:16:47,043 INFO L225 Difference]: With dead ends: 3663 [2021-11-03 05:16:47,044 INFO L226 Difference]: Without dead ends: 3503 [2021-11-03 05:16:47,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 4504 ImplicationChecksByTransitivity, 92.4s TimeCoverageRelationStatistics Valid=1478, Invalid=15845, Unknown=17, NotChecked=3252, Total=20592 [2021-11-03 05:16:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-11-03 05:16:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 1289. [2021-11-03 05:16:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1287 states have (on average 2.4817404817404816) internal successors, (3194), 1288 states have internal predecessors, (3194), 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-11-03 05:16:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 3194 transitions. [2021-11-03 05:16:47,107 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 3194 transitions. Word has length 36 [2021-11-03 05:16:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:16:47,107 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 3194 transitions. [2021-11-03 05:16:47,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9433962264150944) internal successors, (103), 54 states have internal predecessors, (103), 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-11-03 05:16:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 3194 transitions. [2021-11-03 05:16:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 05:16:47,110 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:16:47,111 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:16:47,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 05:16:47,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-03 05:16:47,334 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:16:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:16:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -519223587, now seen corresponding path program 4 times [2021-11-03 05:16:47,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:16:47,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968859229] [2021-11-03 05:16:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:16:47,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:16:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:16:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:16:48,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:16:48,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968859229] [2021-11-03 05:16:48,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968859229] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:16:48,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41804056] [2021-11-03 05:16:48,243 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-03 05:16:48,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:16:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:16:48,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:16:48,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-03 05:16:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:16:48,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-03 05:16:48,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:16:48,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-11-03 05:16:49,452 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-03 05:16:49,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-03 05:16:50,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 45 [2021-11-03 05:16:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:16:56,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:16:59,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) is different from false [2021-11-03 05:17:36,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-11-03 05:17:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-03 05:17:37,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41804056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:17:37,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [788111879] [2021-11-03 05:17:37,203 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:17:37,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:17:37,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 52 [2021-11-03 05:17:37,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845409073] [2021-11-03 05:17:37,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-03 05:17:37,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:17:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-03 05:17:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2484, Unknown=3, NotChecked=100, Total=2756 [2021-11-03 05:17:37,206 INFO L87 Difference]: Start difference. First operand 1289 states and 3194 transitions. Second operand has 53 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 53 states have internal predecessors, (103), 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-11-03 05:17:48,671 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse2 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse2 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= .cse1 4) (<= c_~top~0 1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0))))) is different from false [2021-11-03 05:17:52,946 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) 0))) (and (<= 0 .cse0) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= c_~top~0 1) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-03 05:18:47,963 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse2 (select .cse3 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= c_~top~0 2) (<= 0 .cse1) (< .cse0 4294967296) (<= 0 .cse2) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:18:52,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= 0 .cse0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:18:58,763 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= 0 .cse0) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|))) is different from false [2021-11-03 05:19:58,247 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= 0 .cse1) (< .cse0 4294967296) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:20:32,938 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base))) (let ((.cse1 (select (store .cse3 (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse3 0)) (.cse2 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (= c_t1Thread1of1ForFork0_push_~stack.offset 0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (= c_~top~0 1) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= .cse1 4) (<= c_~top~0 1) (= c_t2Thread1of1ForFork1_pop_~stack.offset 0) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (<= .cse0 4) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)) (<= .cse2 4)))) is different from false [2021-11-03 05:20:39,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse5 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse3 (select .cse4 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (<= 0 .cse0) (< .cse0 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:20:41,729 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse2 (select .cse3 0))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse0 4294967296) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= .cse2 4) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= .cse1 4) (<= 0 .cse0) (<= c_~top~0 1) (<= 0 .cse2) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:21:24,775 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_t2Thread1of1ForFork1_pop_~stack.base) (+ .cse2 c_t2Thread1of1ForFork1_pop_~stack.offset))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4))))) (and (<= 0 c_t1Thread1of1ForFork0_push_~x) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (< .cse0 4294967296) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= 0 .cse1) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:21:37,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ (* |c_t1Thread1of1ForFork0_get_top_#res| 4) c_t1Thread1of1ForFork0_push_~stack.offset) c_t1Thread1of1ForFork0_push_~x) 0)) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse3 (select .cse4 0))) (and (<= 0 .cse0) (<= 0 c_t1Thread1of1ForFork0_push_~x) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< (div c_t1Thread1of1ForFork0_push_~x (- 4294967296)) (+ (div (+ (* c_t1Thread1of1ForFork0_push_~x (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= .cse3 4) (<= |c_~#arr~0.offset| c_t1Thread1of1ForFork0_push_~stack.offset) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_get_top_#res_72| Int)) (or (forall ((t1Thread1of1ForFork0_push_~x Int)) (not (= (mod (select (select (store |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base (store (select |c_#memory_int| c_t1Thread1of1ForFork0_push_~stack.base) (+ c_t1Thread1of1ForFork0_push_~stack.offset (* |v_t1Thread1of1ForFork0_get_top_#res_72| 4)) t1Thread1of1ForFork0_push_~x)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_get_top_#res_72| c_~top~0))) (<= .cse2 4) (<= 0 .cse1) (<= c_~top~0 1) (< .cse0 4294967296) (<= 0 .cse3) (< c_t1Thread1of1ForFork0_push_~x 4294967296) (= c_t1Thread1of1ForFork0_push_~stack.base |c_~#arr~0.base|)))) is different from false [2021-11-03 05:22:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:22:01,686 INFO L93 Difference]: Finished difference Result 3527 states and 7906 transitions. [2021-11-03 05:22:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-11-03 05:22:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 53 states have internal predecessors, (103), 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 36 [2021-11-03 05:22:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:22:01,709 INFO L225 Difference]: With dead ends: 3527 [2021-11-03 05:22:01,709 INFO L226 Difference]: Without dead ends: 3371 [2021-11-03 05:22:01,712 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 4235 ImplicationChecksByTransitivity, 97.7s TimeCoverageRelationStatistics Valid=1439, Invalid=15107, Unknown=14, NotChecked=3180, Total=19740 [2021-11-03 05:22:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2021-11-03 05:22:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 1289. [2021-11-03 05:22:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1287 states have (on average 2.4817404817404816) internal successors, (3194), 1288 states have internal predecessors, (3194), 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-11-03 05:22:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 3194 transitions. [2021-11-03 05:22:01,777 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 3194 transitions. Word has length 36 [2021-11-03 05:22:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:22:01,778 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 3194 transitions. [2021-11-03 05:22:01,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 53 states have internal predecessors, (103), 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-11-03 05:22:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 3194 transitions. [2021-11-03 05:22:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-03 05:22:01,782 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:22:01,782 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:22:01,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-03 05:22:02,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-03 05:22:02,010 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-03 05:22:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:22:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash 884789901, now seen corresponding path program 5 times [2021-11-03 05:22:02,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:22:02,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112735877] [2021-11-03 05:22:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:22:02,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:22:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:22:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:22:03,076 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:22:03,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112735877] [2021-11-03 05:22:03,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112735877] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:22:03,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081083860] [2021-11-03 05:22:03,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:22:03,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:22:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:22:03,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:22:03,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e328bef-84b6-4bb1-9456-19a314d303f0/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-03 05:22:03,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-03 05:22:03,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:22:03,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-03 05:22:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:22:03,560 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-03 05:22:03,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 825 treesize of output 819 [2021-11-03 05:22:04,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-11-03 05:22:04,124 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-03 05:22:04,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-11-03 05:22:04,547 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-03 05:22:04,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-03 05:22:05,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 36 [2021-11-03 05:22:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:22:05,387 INFO L328 TraceCheckSpWp]: Computing backward predicates...