./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longer-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7 --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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:10:09,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:10:09,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:10:09,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:10:09,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:10:09,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:10:09,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:10:09,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:10:09,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:10:09,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:10:09,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:10:09,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:10:09,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:10:09,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:10:09,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:10:09,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:10:09,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:10:09,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:10:09,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:10:09,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:10:09,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:10:09,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:10:09,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:10:09,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:10:09,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:10:09,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:10:09,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:10:09,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:10:09,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:10:09,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:10:09,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:10:09,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:10:09,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:10:09,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:10:09,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:10:09,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:10:09,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:10:09,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:10:09,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:10:09,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:10:09,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:10:09,574 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:10:09,600 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:10:09,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:10:09,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:10:09,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:10:09,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:10:09,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:10:09,602 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:10:09,602 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:10:09,603 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:10:09,603 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:10:09,603 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:10:09,603 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:10:09,604 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:10:09,604 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:10:09,604 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:10:09,604 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:10:09,605 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:10:09,605 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:10:09,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:10:09,606 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:10:09,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:10:09,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:10:09,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:10:09,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:10:09,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:10:09,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:10:09,608 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:10:09,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:10:09,608 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:10:09,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:10:09,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:10:09,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:10:09,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:10:09,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:10:09,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:10:09,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:10:09,610 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:10:09,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:10:09,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:10:09,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:10:09,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:10:09,611 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_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/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_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7 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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2021-11-25 18:10:09,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:10:09,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:10:09,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:10:09,909 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:10:09,909 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:10:09,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread/stack_longer-2.i [2021-11-25 18:10:09,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/data/9456bfb01/5d117236a7304a83b4d26ba6c511e834/FLAGd8964013a [2021-11-25 18:10:10,510 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:10:10,510 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/sv-benchmarks/c/pthread/stack_longer-2.i [2021-11-25 18:10:10,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/data/9456bfb01/5d117236a7304a83b4d26ba6c511e834/FLAGd8964013a [2021-11-25 18:10:10,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/data/9456bfb01/5d117236a7304a83b4d26ba6c511e834 [2021-11-25 18:10:10,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:10:10,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:10:10,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:10:10,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:10:10,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:10:10,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:10" (1/1) ... [2021-11-25 18:10:10,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@415b6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:10, skipping insertion in model container [2021-11-25 18:10:10,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:10" (1/1) ... [2021-11-25 18:10:10,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:10:10,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:10:11,390 WARN L230 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_18e9c399-d567-49f0-a10c-91499a3979b9/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2021-11-25 18:10:11,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:10:11,426 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:10:11,469 WARN L230 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_18e9c399-d567-49f0-a10c-91499a3979b9/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2021-11-25 18:10:11,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:10:11,565 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:10:11,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11 WrapperNode [2021-11-25 18:10:11,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:10:11,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:10:11,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:10:11,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:10:11,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,625 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2021-11-25 18:10:11,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:10:11,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:10:11,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:10:11,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:10:11,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:10:11,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:10:11,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:10:11,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:10:11,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (1/1) ... [2021-11-25 18:10:11,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:10:11,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:11,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:10:11,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:10:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-25 18:10:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-25 18:10:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-25 18:10:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-25 18:10:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:10:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:10:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:10:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:10:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 18:10:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:10:11,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:10:11,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:10:11,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:10:11,751 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 18:10:11,919 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:10:11,921 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:10:12,243 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:10:12,253 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:10:12,253 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-25 18:10:12,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:12 BoogieIcfgContainer [2021-11-25 18:10:12,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:10:12,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:10:12,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:10:12,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:10:12,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:10:10" (1/3) ... [2021-11-25 18:10:12,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:12, skipping insertion in model container [2021-11-25 18:10:12,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:11" (2/3) ... [2021-11-25 18:10:12,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:12, skipping insertion in model container [2021-11-25 18:10:12,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:12" (3/3) ... [2021-11-25 18:10:12,278 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2021-11-25 18:10:12,284 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 18:10:12,284 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:10:12,284 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-25 18:10:12,284 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 18:10:12,370 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,371 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,372 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,373 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,374 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,375 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,376 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,376 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,376 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,376 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,376 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,377 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,377 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,377 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,377 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,377 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,378 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,378 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,378 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,378 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,381 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,381 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,381 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,383 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,384 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,384 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,384 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,384 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,385 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,385 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,385 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,385 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,385 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,386 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,386 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,386 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,386 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,387 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,387 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,387 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,387 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,387 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,388 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,388 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,388 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,389 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,389 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,390 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,391 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,393 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,394 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,394 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,395 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,395 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,397 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,403 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,404 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,405 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,406 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,407 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,408 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,409 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,409 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,409 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,410 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,411 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,412 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,413 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,414 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,415 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,416 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,417 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,420 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,421 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,422 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,423 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,424 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,425 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,426 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,427 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,428 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,429 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,430 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,431 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,432 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,433 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,434 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,435 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,436 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,439 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,440 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,441 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,444 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,444 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,445 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,445 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,445 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,445 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,445 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,446 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,446 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,454 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,454 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,454 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,454 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,454 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,455 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,456 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,457 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,458 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,459 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,464 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,464 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,465 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,466 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,466 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,466 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,466 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,467 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,467 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,467 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,468 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,469 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,472 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,472 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,472 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,473 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,473 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,473 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,473 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,473 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,474 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,475 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 18:10:12,482 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 18:10:12,541 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:10:12,550 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-25 18:10:12,551 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-25 18:10:12,569 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 18:10:12,581 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 172 transitions, 360 flow [2021-11-25 18:10:12,584 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 172 transitions, 360 flow [2021-11-25 18:10:12,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 172 transitions, 360 flow [2021-11-25 18:10:12,656 INFO L129 PetriNetUnfolder]: 10/170 cut-off events. [2021-11-25 18:10:12,656 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 18:10:12,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 10/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2021-11-25 18:10:12,671 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2021-11-25 18:10:17,534 INFO L131 LiptonReduction]: Checked pairs total: 11267 [2021-11-25 18:10:17,534 INFO L133 LiptonReduction]: Total number of compositions: 165 [2021-11-25 18:10:17,552 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 90 flow [2021-11-25 18:10:17,581 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 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-25 18:10:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 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-25 18:10:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-25 18:10:17,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:17,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-25 18:10:17,604 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-25 18:10:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash -774186158, now seen corresponding path program 1 times [2021-11-25 18:10:17,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:17,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328841317] [2021-11-25 18:10:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:17,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:17,929 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-25 18:10:17,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:17,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328841317] [2021-11-25 18:10:17,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328841317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:17,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:17,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:10:17,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589368281] [2021-11-25 18:10:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:17,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:10:17,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:10:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:10:17,972 INFO L87 Difference]: Start difference. First operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 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-25 18:10:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:18,121 INFO L93 Difference]: Finished difference Result 434 states and 1115 transitions. [2021-11-25 18:10:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:10:18,123 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-25 18:10:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:18,149 INFO L225 Difference]: With dead ends: 434 [2021-11-25 18:10:18,149 INFO L226 Difference]: Without dead ends: 416 [2021-11-25 18:10:18,150 INFO L932 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-25 18:10:18,155 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:18,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:10:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-25 18:10:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 392. [2021-11-25 18:10:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 389 states have (on average 2.67866323907455) internal successors, (1042), 391 states have internal predecessors, (1042), 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-25 18:10:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1042 transitions. [2021-11-25 18:10:18,258 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1042 transitions. Word has length 6 [2021-11-25 18:10:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:18,261 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 1042 transitions. [2021-11-25 18:10:18,262 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-25 18:10:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1042 transitions. [2021-11-25 18:10:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:10:18,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:18,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:10:18,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:10:18,265 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-25 18:10:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1395510492, now seen corresponding path program 1 times [2021-11-25 18:10:18,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:18,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504866150] [2021-11-25 18:10:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:18,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:18,360 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-25 18:10:18,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:18,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504866150] [2021-11-25 18:10:18,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504866150] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:18,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:18,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:10:18,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177688576] [2021-11-25 18:10:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:18,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:10:18,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:10:18,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:10:18,364 INFO L87 Difference]: Start difference. First operand 392 states and 1042 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-25 18:10:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:18,444 INFO L93 Difference]: Finished difference Result 432 states and 1145 transitions. [2021-11-25 18:10:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:10:18,445 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-25 18:10:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:18,449 INFO L225 Difference]: With dead ends: 432 [2021-11-25 18:10:18,450 INFO L226 Difference]: Without dead ends: 432 [2021-11-25 18:10:18,451 INFO L932 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-25 18:10:18,452 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:18,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:10:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-25 18:10:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-11-25 18:10:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 429 states have (on average 2.668997668997669) internal successors, (1145), 431 states have internal predecessors, (1145), 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-25 18:10:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1145 transitions. [2021-11-25 18:10:18,484 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1145 transitions. Word has length 10 [2021-11-25 18:10:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:18,485 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1145 transitions. [2021-11-25 18:10:18,485 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-25 18:10:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1145 transitions. [2021-11-25 18:10:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:10:18,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:18,488 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:10:18,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:10:18,490 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-25 18:10:18,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:18,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1627868975, now seen corresponding path program 1 times [2021-11-25 18:10:18,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:18,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471401182] [2021-11-25 18:10:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:18,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:18,620 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-25 18:10:18,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:18,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471401182] [2021-11-25 18:10:18,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471401182] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316363677] [2021-11-25 18:10:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:18,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:18,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:18,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:10:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:10:18,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:18,851 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-25 18:10:18,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:10:18,931 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-25 18:10:18,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316363677] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:10:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575476989] [2021-11-25 18:10:18,943 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:610) 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-25 18:10:18,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:10:18,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-25 18:10:18,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110710931] [2021-11-25 18:10:18,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:10:18,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 18:10:18,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 18:10:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-25 18:10:18,948 INFO L87 Difference]: Start difference. First operand 432 states and 1145 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-25 18:10:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:19,315 INFO L93 Difference]: Finished difference Result 1058 states and 2714 transitions. [2021-11-25 18:10:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 18:10:19,316 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-25 18:10:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:19,325 INFO L225 Difference]: With dead ends: 1058 [2021-11-25 18:10:19,325 INFO L226 Difference]: Without dead ends: 1046 [2021-11-25 18:10:19,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:10:19,329 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 211 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:19,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 5 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:10:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-11-25 18:10:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 720. [2021-11-25 18:10:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 717 states have (on average 2.693165969316597) internal successors, (1931), 719 states have internal predecessors, (1931), 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-25 18:10:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1931 transitions. [2021-11-25 18:10:19,365 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1931 transitions. Word has length 13 [2021-11-25 18:10:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:19,365 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1931 transitions. [2021-11-25 18:10:19,366 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-25 18:10:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1931 transitions. [2021-11-25 18:10:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 18:10:19,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:19,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:10:19,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:10:19,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:19,597 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-25 18:10:19,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1145049209, now seen corresponding path program 1 times [2021-11-25 18:10:19,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:19,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168548871] [2021-11-25 18:10:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:19,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:19,682 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-25 18:10:19,682 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:19,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168548871] [2021-11-25 18:10:19,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168548871] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:19,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:19,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:10:19,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51439143] [2021-11-25 18:10:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:19,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:10:19,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:19,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:10:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:10:19,685 INFO L87 Difference]: Start difference. First operand 720 states and 1931 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-25 18:10:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:19,748 INFO L93 Difference]: Finished difference Result 310 states and 703 transitions. [2021-11-25 18:10:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:10:19,748 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-25 18:10:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:19,751 INFO L225 Difference]: With dead ends: 310 [2021-11-25 18:10:19,751 INFO L226 Difference]: Without dead ends: 310 [2021-11-25 18:10:19,751 INFO L932 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-25 18:10:19,752 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:19,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:10:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-25 18:10:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2021-11-25 18:10:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 2.2447552447552446) internal successors, (642), 287 states have internal predecessors, (642), 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-25 18:10:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 642 transitions. [2021-11-25 18:10:19,763 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 642 transitions. Word has length 16 [2021-11-25 18:10:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:19,764 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 642 transitions. [2021-11-25 18:10:19,764 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-25 18:10:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 642 transitions. [2021-11-25 18:10:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:10:19,765 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:19,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:10:19,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:10:19,766 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-25 18:10:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash -511957004, now seen corresponding path program 1 times [2021-11-25 18:10:19,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:19,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680104516] [2021-11-25 18:10:19,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:19,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:19,807 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-25 18:10:19,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:19,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680104516] [2021-11-25 18:10:19,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680104516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:19,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:19,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:10:19,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56763096] [2021-11-25 18:10:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:19,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:10:19,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:19,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:10:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:10:19,810 INFO L87 Difference]: Start difference. First operand 288 states and 642 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-25 18:10:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:19,891 INFO L93 Difference]: Finished difference Result 346 states and 774 transitions. [2021-11-25 18:10:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:10:19,891 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-25 18:10:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:19,894 INFO L225 Difference]: With dead ends: 346 [2021-11-25 18:10:19,894 INFO L226 Difference]: Without dead ends: 340 [2021-11-25 18:10:19,894 INFO L932 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-25 18:10:19,895 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:19,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:10:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-25 18:10:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2021-11-25 18:10:19,905 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-25 18:10:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2021-11-25 18:10:19,906 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2021-11-25 18:10:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:19,907 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2021-11-25 18:10:19,908 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-25 18:10:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2021-11-25 18:10:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:10:19,909 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:19,909 INFO L514 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-25 18:10:19,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 18:10:19,909 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-25 18:10:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 415194429, now seen corresponding path program 1 times [2021-11-25 18:10:19,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:19,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050581657] [2021-11-25 18:10:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:19,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:20,239 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-25 18:10:20,239 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050581657] [2021-11-25 18:10:20,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050581657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:20,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:20,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 18:10:20,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316073140] [2021-11-25 18:10:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:20,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:10:20,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:10:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:10:20,241 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:20,780 INFO L93 Difference]: Finished difference Result 489 states and 1074 transitions. [2021-11-25 18:10:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:10:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:20,784 INFO L225 Difference]: With dead ends: 489 [2021-11-25 18:10:20,784 INFO L226 Difference]: Without dead ends: 440 [2021-11-25 18:10:20,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:10:20,785 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 115 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:20,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 6 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:10:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-25 18:10:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 340. [2021-11-25 18:10:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.275147928994083) internal successors, (769), 339 states have internal predecessors, (769), 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-25 18:10:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 769 transitions. [2021-11-25 18:10:20,798 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 769 transitions. Word has length 21 [2021-11-25 18:10:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:20,799 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 769 transitions. [2021-11-25 18:10:20,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 769 transitions. [2021-11-25 18:10:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:10:20,800 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:20,800 INFO L514 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-25 18:10:20,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 18:10:20,801 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-25 18:10:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1253157149, now seen corresponding path program 2 times [2021-11-25 18:10:20,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971087707] [2021-11-25 18:10:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:20,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:21,136 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-25 18:10:21,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:21,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971087707] [2021-11-25 18:10:21,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971087707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:21,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:21,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-25 18:10:21,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223797795] [2021-11-25 18:10:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:21,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:10:21,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:10:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:10:21,139 INFO L87 Difference]: Start difference. First operand 340 states and 769 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:21,754 INFO L93 Difference]: Finished difference Result 516 states and 1134 transitions. [2021-11-25 18:10:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:10:21,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:21,758 INFO L225 Difference]: With dead ends: 516 [2021-11-25 18:10:21,758 INFO L226 Difference]: Without dead ends: 466 [2021-11-25 18:10:21,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:10:21,759 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 122 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:21,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 7 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 18:10:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-11-25 18:10:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 328. [2021-11-25 18:10:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 326 states have (on average 2.2607361963190185) internal successors, (737), 327 states have internal predecessors, (737), 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-25 18:10:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 737 transitions. [2021-11-25 18:10:21,773 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 737 transitions. Word has length 21 [2021-11-25 18:10:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:21,774 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 737 transitions. [2021-11-25 18:10:21,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 18:10:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 737 transitions. [2021-11-25 18:10:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:10:21,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:21,776 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:10:21,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 18:10:21,776 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 18:10:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash -447250857, now seen corresponding path program 1 times [2021-11-25 18:10:21,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373210249] [2021-11-25 18:10:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:21,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:21,907 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-25 18:10:21,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373210249] [2021-11-25 18:10:21,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373210249] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662848941] [2021-11-25 18:10:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:21,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:21,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:21,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:10:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:22,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:10:22,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:10:22,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:10:22,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662848941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:22,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:10:22,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-11-25 18:10:22,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132940047] [2021-11-25 18:10:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:22,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:10:22,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:10:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:10:22,094 INFO L87 Difference]: Start difference. First operand 328 states and 737 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-25 18:10:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:22,252 INFO L93 Difference]: Finished difference Result 438 states and 953 transitions. [2021-11-25 18:10:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:10:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 24 [2021-11-25 18:10:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:22,255 INFO L225 Difference]: With dead ends: 438 [2021-11-25 18:10:22,256 INFO L226 Difference]: Without dead ends: 430 [2021-11-25 18:10:22,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:10:22,257 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:22,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:10:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-25 18:10:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 380. [2021-11-25 18:10:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 378 states have (on average 2.240740740740741) internal successors, (847), 379 states have internal predecessors, (847), 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-25 18:10:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 847 transitions. [2021-11-25 18:10:22,271 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 847 transitions. Word has length 24 [2021-11-25 18:10:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:22,271 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 847 transitions. [2021-11-25 18:10:22,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-25 18:10:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 847 transitions. [2021-11-25 18:10:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 18:10:22,273 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:22,273 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2021-11-25 18:10:22,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:10:22,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:22,494 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-25 18:10:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1675970993, now seen corresponding path program 2 times [2021-11-25 18:10:22,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81895911] [2021-11-25 18:10:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:22,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:22,599 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-25 18:10:22,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81895911] [2021-11-25 18:10:22,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81895911] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308245670] [2021-11-25 18:10:22,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:10:22,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:22,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:22,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:22,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:10:22,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:10:22,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:10:22,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:10:22,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:22,859 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-25 18:10:22,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:10:22,995 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-25 18:10:22,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308245670] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:10:22,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956887954] [2021-11-25 18:10:22,996 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:610) 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-25 18:10:22,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:10:22,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2021-11-25 18:10:22,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937352709] [2021-11-25 18:10:22,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:10:22,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-25 18:10:22,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-25 18:10:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:10:22,998 INFO L87 Difference]: Start difference. First operand 380 states and 847 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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-25 18:10:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:23,401 INFO L93 Difference]: Finished difference Result 868 states and 1863 transitions. [2021-11-25 18:10:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:10:23,401 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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-25 18:10:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:23,408 INFO L225 Difference]: With dead ends: 868 [2021-11-25 18:10:23,408 INFO L226 Difference]: Without dead ends: 868 [2021-11-25 18:10:23,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:10:23,409 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 229 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:23,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 5 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:10:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2021-11-25 18:10:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 604. [2021-11-25 18:10:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 602 states have (on average 2.250830564784053) internal successors, (1355), 603 states have internal predecessors, (1355), 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-25 18:10:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1355 transitions. [2021-11-25 18:10:23,455 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1355 transitions. Word has length 27 [2021-11-25 18:10:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:23,456 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 1355 transitions. [2021-11-25 18:10:23,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 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-25 18:10:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1355 transitions. [2021-11-25 18:10:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:10:23,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:23,457 INFO L514 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-25 18:10:23,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-25 18:10:23,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-25 18:10:23,686 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-25 18:10:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1873591140, now seen corresponding path program 3 times [2021-11-25 18:10:23,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:23,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408946535] [2021-11-25 18:10:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:23,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:10:24,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:24,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408946535] [2021-11-25 18:10:24,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408946535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:10:24,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:10:24,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-25 18:10:24,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091907190] [2021-11-25 18:10:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:10:24,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 18:10:24,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:10:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 18:10:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-11-25 18:10:24,073 INFO L87 Difference]: Start difference. First operand 604 states and 1355 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:10:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:10:25,673 INFO L93 Difference]: Finished difference Result 1237 states and 2747 transitions. [2021-11-25 18:10:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 18:10:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 18:10:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:10:25,683 INFO L225 Difference]: With dead ends: 1237 [2021-11-25 18:10:25,683 INFO L226 Difference]: Without dead ends: 1205 [2021-11-25 18:10:25,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=268, Invalid=1214, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 18:10:25,685 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 18:10:25,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 18:10:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2021-11-25 18:10:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 726. [2021-11-25 18:10:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 724 states have (on average 2.341160220994475) internal successors, (1695), 725 states have internal predecessors, (1695), 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-25 18:10:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1695 transitions. [2021-11-25 18:10:25,715 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1695 transitions. Word has length 28 [2021-11-25 18:10:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:10:25,716 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1695 transitions. [2021-11-25 18:10:25,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:10:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1695 transitions. [2021-11-25 18:10:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:10:25,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:10:25,718 INFO L514 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-25 18:10:25,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 18:10:25,718 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-25 18:10:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:10:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1156335038, now seen corresponding path program 4 times [2021-11-25 18:10:25,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:10:25,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998867403] [2021-11-25 18:10:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:10:25,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:10:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:10:26,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:10:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998867403] [2021-11-25 18:10:26,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998867403] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:10:26,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144422300] [2021-11-25 18:10:26,090 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 18:10:26,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:10:26,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:10:26,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:10:26,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:10:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:10:26,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-25 18:10:26,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:10:26,312 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 18:10:26,313 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 29 treesize of output 34 [2021-11-25 18:10:26,952 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 19 treesize of output 15 [2021-11-25 18:10:27,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2021-11-25 18:10:27,711 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 77 treesize of output 45 [2021-11-25 18:11:07,779 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-25 18:11:07,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:11:08,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_360) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2021-11-25 18:11:08,277 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:11:08,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-25 18:11:08,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:11:08,289 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 49 treesize of output 52 [2021-11-25 18:11:08,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2021-11-25 18:11:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:11:08,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144422300] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:11:08,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598163333] [2021-11-25 18:11:08,648 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:610) 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-25 18:11:08,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:11:08,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 44 [2021-11-25 18:11:08,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017689391] [2021-11-25 18:11:08,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:11:08,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-25 18:11:08,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:11:08,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-25 18:11:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1804, Unknown=17, NotChecked=86, Total=2070 [2021-11-25 18:11:08,652 INFO L87 Difference]: Start difference. First operand 726 states and 1695 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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-25 18:11:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:11:20,987 INFO L93 Difference]: Finished difference Result 2052 states and 4482 transitions. [2021-11-25 18:11:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-25 18:11:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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-25 18:11:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:11:21,005 INFO L225 Difference]: With dead ends: 2052 [2021-11-25 18:11:21,006 INFO L226 Difference]: Without dead ends: 2052 [2021-11-25 18:11:21,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 1 IntricatePredicates, 4 DeprecatedPredicates, 2873 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=1131, Invalid=9158, Unknown=17, NotChecked=200, Total=10506 [2021-11-25 18:11:21,011 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 739 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-25 18:11:21,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 1 Invalid, 4909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4481 Invalid, 0 Unknown, 275 Unchecked, 3.5s Time] [2021-11-25 18:11:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2021-11-25 18:11:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 818. [2021-11-25 18:11:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 816 states have (on average 2.366421568627451) internal successors, (1931), 817 states have internal predecessors, (1931), 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-25 18:11:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1931 transitions. [2021-11-25 18:11:21,054 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1931 transitions. Word has length 28 [2021-11-25 18:11:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:11:21,055 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1931 transitions. [2021-11-25 18:11:21,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 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-25 18:11:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1931 transitions. [2021-11-25 18:11:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 18:11:21,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:11:21,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:11:21,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:11:21,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 18:11:21,269 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-25 18:11:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:11:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1486646726, now seen corresponding path program 1 times [2021-11-25 18:11:21,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:11:21,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476262500] [2021-11-25 18:11:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:11:21,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:11:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:11:23,083 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-25 18:11:23,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:11:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476262500] [2021-11-25 18:11:23,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476262500] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:11:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944856608] [2021-11-25 18:11:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:11:23,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:11:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:11:23,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:11:23,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:11:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:11:23,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-25 18:11:23,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:11:23,224 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-11-25 18:11:23,225 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 29 treesize of output 34 [2021-11-25 18:11:23,886 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 19 treesize of output 15 [2021-11-25 18:11:24,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2021-11-25 18:11:24,782 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 77 treesize of output 45 [2021-11-25 18:12:06,785 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-25 18:12:06,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:12:07,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_420) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2021-11-25 18:12:07,422 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:12:07,423 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-11-25 18:12:07,434 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:12:07,435 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 49 treesize of output 52 [2021-11-25 18:12:07,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2021-11-25 18:12:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:12:07,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944856608] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:12:07,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1769960938] [2021-11-25 18:12:07,827 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:610) 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-25 18:12:07,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:12:07,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 14] total 49 [2021-11-25 18:12:07,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988208270] [2021-11-25 18:12:07,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:12:07,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-25 18:12:07,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:12:07,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-25 18:12:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2221, Unknown=19, NotChecked=96, Total=2550 [2021-11-25 18:12:07,830 INFO L87 Difference]: Start difference. First operand 818 states and 1931 transitions. Second operand has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 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-25 18:12:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:12:34,259 INFO L93 Difference]: Finished difference Result 2142 states and 4714 transitions. [2021-11-25 18:12:34,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-25 18:12:34,260 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 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 29 [2021-11-25 18:12:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:12:34,276 INFO L225 Difference]: With dead ends: 2142 [2021-11-25 18:12:34,276 INFO L226 Difference]: Without dead ends: 2142 [2021-11-25 18:12:34,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4076 ImplicationChecksByTransitivity, 64.5s TimeCoverageRelationStatistics Valid=1449, Invalid=13040, Unknown=35, NotChecked=238, Total=14762 [2021-11-25 18:12:34,283 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1016 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 4122 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 4122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 396 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:12:34,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1016 Valid, 0 Invalid, 4737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 4122 Invalid, 0 Unknown, 396 Unchecked, 6.0s Time] [2021-11-25 18:12:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2021-11-25 18:12:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 800. [2021-11-25 18:12:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 798 states have (on average 2.3684210526315788) internal successors, (1890), 799 states have internal predecessors, (1890), 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-25 18:12:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1890 transitions. [2021-11-25 18:12:34,327 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1890 transitions. Word has length 29 [2021-11-25 18:12:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:12:34,328 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 1890 transitions. [2021-11-25 18:12:34,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 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-25 18:12:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1890 transitions. [2021-11-25 18:12:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 18:12:34,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:12:34,330 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:12:34,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:12:34,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:34,546 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-25 18:12:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:12:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1486646943, now seen corresponding path program 1 times [2021-11-25 18:12:34,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:12:34,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112428354] [2021-11-25 18:12:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:34,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:12:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:12:34,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:12:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112428354] [2021-11-25 18:12:34,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112428354] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:12:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423374051] [2021-11-25 18:12:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:34,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:12:34,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:12:34,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:12:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:34,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:12:34,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:12:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:12:34,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:12:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:12:34,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423374051] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:12:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [634389600] [2021-11-25 18:12:34,949 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:610) 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-25 18:12:34,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:12:34,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-11-25 18:12:34,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94894075] [2021-11-25 18:12:34,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:12:34,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 18:12:34,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:12:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 18:12:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:12:34,952 INFO L87 Difference]: Start difference. First operand 800 states and 1890 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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-25 18:12:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:12:35,191 INFO L93 Difference]: Finished difference Result 1766 states and 3771 transitions. [2021-11-25 18:12:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:12:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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 29 [2021-11-25 18:12:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:12:35,204 INFO L225 Difference]: With dead ends: 1766 [2021-11-25 18:12:35,205 INFO L226 Difference]: Without dead ends: 1766 [2021-11-25 18:12:35,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:12:35,206 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 189 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:12:35,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 8 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:12:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2021-11-25 18:12:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1198. [2021-11-25 18:12:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1195 states have (on average 2.3271966527196652) internal successors, (2781), 1197 states have internal predecessors, (2781), 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-25 18:12:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 2781 transitions. [2021-11-25 18:12:35,263 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 2781 transitions. Word has length 29 [2021-11-25 18:12:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:12:35,263 INFO L470 AbstractCegarLoop]: Abstraction has 1198 states and 2781 transitions. [2021-11-25 18:12:35,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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-25 18:12:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 2781 transitions. [2021-11-25 18:12:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 18:12:35,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:12:35,265 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:12:35,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:12:35,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:35,479 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-25 18:12:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:12:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1239999792, now seen corresponding path program 2 times [2021-11-25 18:12:35,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:12:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234618195] [2021-11-25 18:12:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:35,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:12:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:12:35,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:12:35,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234618195] [2021-11-25 18:12:35,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234618195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:12:35,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235869888] [2021-11-25 18:12:35,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:12:35,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:12:35,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:12:35,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:12:35,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:12:35,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:12:35,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-25 18:12:35,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:12:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:12:35,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 18:12:35,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235869888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:12:35,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 18:12:35,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-11-25 18:12:35,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497385145] [2021-11-25 18:12:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:12:35,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:12:35,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:12:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:12:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-25 18:12:35,799 INFO L87 Difference]: Start difference. First operand 1198 states and 2781 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-25 18:12:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:12:35,974 INFO L93 Difference]: Finished difference Result 1438 states and 3267 transitions. [2021-11-25 18:12:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:12:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 31 [2021-11-25 18:12:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:12:35,982 INFO L225 Difference]: With dead ends: 1438 [2021-11-25 18:12:35,983 INFO L226 Difference]: Without dead ends: 1438 [2021-11-25 18:12:35,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:12:35,984 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:12:35,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:12:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2021-11-25 18:12:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1256. [2021-11-25 18:12:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1253 states have (on average 2.3224261771747807) internal successors, (2910), 1255 states have internal predecessors, (2910), 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-25 18:12:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2910 transitions. [2021-11-25 18:12:36,028 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2910 transitions. Word has length 31 [2021-11-25 18:12:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:12:36,028 INFO L470 AbstractCegarLoop]: Abstraction has 1256 states and 2910 transitions. [2021-11-25 18:12:36,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-25 18:12:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2910 transitions. [2021-11-25 18:12:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 18:12:36,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:12:36,031 INFO L514 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-25 18:12:36,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:12:36,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 18:12:36,254 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-25 18:12:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:12:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1198232037, now seen corresponding path program 1 times [2021-11-25 18:12:36,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:12:36,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925858705] [2021-11-25 18:12:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:36,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:12:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:37,332 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-25 18:12:37,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:12:37,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925858705] [2021-11-25 18:12:37,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925858705] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:12:37,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662407413] [2021-11-25 18:12:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:12:37,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:12:37,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:12:37,340 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:12:37,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:12:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:12:37,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 18:12:37,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:12:37,840 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 19 treesize of output 15 [2021-11-25 18:12:38,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:12:38,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2021-11-25 18:12:39,267 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-25 18:13:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:13:27,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:13:51,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) is different from false [2021-11-25 18:14:18,087 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-25 18:14:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:14:18,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662407413] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:14:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373715598] [2021-11-25 18:14:18,383 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:610) 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-25 18:14:18,384 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:14:18,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 63 [2021-11-25 18:14:18,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776345567] [2021-11-25 18:14:18,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:14:18,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-25 18:14:18,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:14:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-25 18:14:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3649, Unknown=31, NotChecked=122, Total=4032 [2021-11-25 18:14:18,388 INFO L87 Difference]: Start difference. First operand 1256 states and 2910 transitions. Second operand has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 64 states have internal predecessors, (108), 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-25 18:14:20,957 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse2 (select .cse7 0)) (.cse3 (select .cse7 (+ |c_~#arr~0.offset| .cse6))) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| .cse6 (- 8)))) (.cse4 (select .cse7 (+ |c_~#arr~0.offset| (* |c_t2Thread1of1ForFork1_dec_top_#t~post32#1| 4) (- 8)))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse6 (- 4))))) (and (= c_~top~0 0) (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= .cse2 399) (< (div .cse3 (- 4294967296)) (+ (div (+ 399 (* .cse3 (- 1))) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (< .cse3 4294967296) (= 5 |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 399) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse4 4294967296) (< (div .cse1 (- 4294967296)) (+ (div (+ 399 (* .cse1 (- 1))) 4294967296) 1)) (<= 0 .cse1) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse2) (<= 0 .cse3) (< (div .cse4 (- 4294967296)) (+ (div (+ (* .cse4 (- 1)) 399) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse4) (<= 0 .cse5) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse5 399)))) is different from false [2021-11-25 18:14:26,652 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse3 (- 8)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 (- 4))))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse1 (- 4294967296)) (+ (div (+ 399 (* .cse1 (- 1))) 4294967296) 1)) (<= 0 .cse1) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse2 399)))) is different from false [2021-11-25 18:14:27,996 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse2 (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse1 399)))) is different from false [2021-11-25 18:14:37,805 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (let ((.cse5 (* 4 c_~top~0)) (.cse4 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse3 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 8))))) (and (or (let ((.cse0 (select .cse1 (+ .cse2 (- 4))))) (and (<= .cse0 399) (<= 0 .cse0))) (<= c_~top~0 0)) (<= 0 .cse3) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse4 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 8) (or (let ((.cse6 (select .cse1 (+ .cse2 (- 8))))) (and (<= .cse6 399) (<= 0 .cse6))) (< .cse5 8)) (< (div .cse4 (- 4294967296)) (+ (div (+ 399 (* .cse4 (- 1))) 4294967296) 1)) (<= 0 .cse4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse3 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ 399 (* .cse3 (- 1))) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 18:14:39,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (let ((.cse3 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4))))) (and (or (let ((.cse0 (select .cse1 (+ .cse2 (- 4))))) (and (<= .cse0 399) (<= 0 .cse0))) (<= c_~top~0 0)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse3 (- 4294967296)) (+ (div (+ 399 (* .cse3 (- 1))) 4294967296) 1)) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 18:14:57,626 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) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse1 (- 4294967296)) (+ (div (+ 399 (* .cse1 (- 1))) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 18:15:33,730 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 (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-25 18:15:40,101 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) is different from false [2021-11-25 18:16:30,840 WARN L227 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:16:33,347 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_#in~stack#1.base|) (+ |c_t2Thread1of1ForFork1_pop_#in~stack#1.offset| (* c_~top~0 4) (- 4))) 4294967296))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) is different from false [2021-11-25 18:17:42,594 WARN L227 SmtUtils]: Spent 23.95s on a formula simplification. DAG size of input: 50 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:18:59,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse2 (* 4 c_~top~0))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (= |c_~#arr~0.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= .cse2 8) (or (let ((.cse3 (select .cse0 (+ .cse1 (- 8))))) (and (<= .cse3 399) (<= 0 .cse3))) (< .cse2 8)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 18:20:32,984 WARN L227 SmtUtils]: Spent 42.19s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:20:34,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4)) (.cse1 (* 4 c_~top~0))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_#in~stack#1.base|) (+ |c_t2Thread1of1ForFork1_pop_#in~stack#1.offset| .cse0 (- 4))) 4294967296))) (= |c_~#arr~0.offset| 0) (= |c_t2Thread1of1ForFork1_pop_#in~stack#1.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= .cse1 8) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (or (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ .cse0 (- 8))))) (and (<= .cse2 399) (<= 0 .cse2))) (< .cse1 8)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 18:20:38,452 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 18:20:48,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4)) (.cse3 (* 4 c_~top~0))) (and (or (let ((.cse0 (select .cse1 (+ .cse2 (- 4))))) (and (<= .cse0 399) (<= 0 .cse0))) (< .cse3 4)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4))) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_97| Int) (v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_97|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_97| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (= |c_~#arr~0.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 18:21:58,548 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_607 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_128| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_128| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_607)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* |c_t2Thread1of1ForFork1_dec_top_#t~post32#1| 4) (- 8))) 4294967296) 4294967294))) is different from false [2021-11-25 18:21:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:21:58,802 INFO L93 Difference]: Finished difference Result 6316 states and 13712 transitions. [2021-11-25 18:21:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2021-11-25 18:21:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 64 states have internal predecessors, (108), 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-25 18:21:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:21:58,838 INFO L225 Difference]: With dead ends: 6316 [2021-11-25 18:21:58,838 INFO L226 Difference]: Without dead ends: 6316 [2021-11-25 18:21:58,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 47 SyntacticMatches, 21 SemanticMatches, 257 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 22089 ImplicationChecksByTransitivity, 551.0s TimeCoverageRelationStatistics Valid=4007, Invalid=55178, Unknown=167, NotChecked=7470, Total=66822 [2021-11-25 18:21:58,849 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1696 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 8485 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 11941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 8485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3130 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:21:58,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 2 Invalid, 11941 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [326 Valid, 8485 Invalid, 0 Unknown, 3130 Unchecked, 9.2s Time] [2021-11-25 18:21:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2021-11-25 18:21:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 3266. [2021-11-25 18:21:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 3263 states have (on average 2.4272142200429054) internal successors, (7920), 3265 states have internal predecessors, (7920), 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-25 18:21:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 7920 transitions. [2021-11-25 18:21:58,989 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 7920 transitions. Word has length 36 [2021-11-25 18:21:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:21:58,990 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 7920 transitions. [2021-11-25 18:21:58,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 64 states have internal predecessors, (108), 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-25 18:21:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 7920 transitions. [2021-11-25 18:21:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 18:21:58,994 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:21:58,994 INFO L514 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-25 18:21:59,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:21:59,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 18:21:59,221 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-25 18:21:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:21:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash 672966437, now seen corresponding path program 2 times [2021-11-25 18:21:59,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:21:59,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834124722] [2021-11-25 18:21:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:21:59,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:21:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:22:00,459 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-25 18:22:00,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:22:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834124722] [2021-11-25 18:22:00,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834124722] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:22:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731906451] [2021-11-25 18:22:00,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:22:00,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:22:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:22:00,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:22:00,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18e9c399-d567-49f0-a10c-91499a3979b9/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:22:00,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:22:00,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:22:00,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-25 18:22:00,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:22:00,954 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 19 treesize of output 15 [2021-11-25 18:22:01,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:22:01,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2021-11-25 18:22:02,355 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-25 18:22:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:22:40,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:23:06,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) is different from false [2021-11-25 18:23:38,306 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-25 18:23:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-25 18:23:38,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731906451] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:23:38,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265586437] [2021-11-25 18:23:38,576 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:610) 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-25 18:23:38,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:23:38,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 63 [2021-11-25 18:23:38,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484488426] [2021-11-25 18:23:38,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:23:38,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-25 18:23:38,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:23:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-25 18:23:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3653, Unknown=27, NotChecked=122, Total=4032 [2021-11-25 18:23:38,580 INFO L87 Difference]: Start difference. First operand 3266 states and 7920 transitions. Second operand has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 64 states have internal predecessors, (108), 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-25 18:23:40,772 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (select .cse6 0)) (.cse2 (select .cse6 (+ |c_~#arr~0.offset| .cse5))) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse3 (select .cse6 (+ |c_~#arr~0.offset| (* |c_t2Thread1of1ForFork1_dec_top_#t~post32#1| 4) (- 8)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 (- 4))))) (and (= c_~top~0 0) (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (<= .cse1 2147483647) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse2 (- 4294967296)) (+ (div (+ 399 (* .cse2 (- 1))) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (< .cse2 4294967296) (= 5 |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< .cse3 4294967296) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse1) (<= 0 .cse2) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 399) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse3) (<= 0 .cse4) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse4 2147483647)))) is different from false [2021-11-25 18:23:46,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (let ((.cse0 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse2 (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= 4294967294 (mod (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 8))) 4294967296))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse3) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse3 2147483647)))) is different from false [2021-11-25 18:23:47,752 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse2 (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse1 2147483647)))) is different from false [2021-11-25 18:23:49,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse2 (- 4))))) (and (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (<= .cse1 2147483647)))) is different from false [2021-11-25 18:23:50,512 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 5 |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= .cse0 2147483647))) is different from false [2021-11-25 18:23:52,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* c_~top~0 4) (- 4))))) (and (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse0) (<= .cse0 2147483647))) is different from false [2021-11-25 18:24:01,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8)))) (.cse2 (* 4 c_~top~0))) (and (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ 399 (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= .cse2 8) (or (let ((.cse3 (select .cse4 (+ .cse5 (- 4))))) (and (<= .cse3 2147483647) (<= 0 .cse3))) (<= c_~top~0 0)) (< (div .cse1 (- 4294967296)) (+ (div (+ 399 (* .cse1 (- 1))) 4294967296) 1)) (<= 0 .cse1) (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (or (let ((.cse6 (select .cse4 (+ .cse5 (- 8))))) (and (<= 0 .cse6) (<= .cse6 2147483647))) (< .cse2 8))))) is different from false [2021-11-25 18:24:02,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8)))) (.cse1 (* 4 c_~top~0))) (and (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ 399 (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= 5 |c_~#arr~0.base|) (<= .cse1 8) (or (let ((.cse2 (select .cse3 (+ .cse4 (- 4))))) (and (<= .cse2 2147483647) (<= 0 .cse2))) (<= c_~top~0 0)) (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (or (let ((.cse5 (select .cse3 (+ .cse4 (- 8))))) (and (<= 0 .cse5) (<= .cse5 2147483647))) (< .cse1 8))))) is different from false [2021-11-25 18:24:07,103 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 (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-25 18:24:08,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse2 (* 4 c_~top~0))) (and (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ 399 (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1))) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (= 5 |c_~#arr~0.base|) (<= .cse2 8) (or (let ((.cse3 (select .cse0 (+ .cse1 (- 4))))) (and (<= .cse3 2147483647) (<= 0 .cse3))) (<= c_~top~0 0)) (or (let ((.cse4 (select .cse0 (+ .cse1 (- 8))))) (and (<= 0 .cse4) (<= .cse4 2147483647))) (< .cse2 8)))) is different from false [2021-11-25 18:24:11,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (or (let ((.cse1 (select .cse2 (+ .cse3 (- 4))))) (and (<= .cse1 2147483647) (<= 0 .cse1))) (<= c_~top~0 0)) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-25 18:24:13,828 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) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-25 18:24:15,169 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (let ((.cse0 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 8)))) (.cse3 (* 4 c_~top~0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (not (= (mod (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4))) 4294967296) 4294967294)) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (= 5 |c_~#arr~0.base|) (<= .cse3 8) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (let ((.cse4 (select .cse1 (+ .cse2 (- 8))))) (and (<= 0 .cse4) (<= .cse4 2147483647))) (< .cse3 8))))) is different from false [2021-11-25 18:24:16,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (let ((.cse0 (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 4)))) (.cse3 (* 4 c_~top~0))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 399) 4294967296) 1)) (not (= 4294967294 (mod (select .cse1 (+ |c_~#arr~0.offset| .cse2 (- 8))) 4294967296))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse3 8) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_136| Int) (v_ArrVal_675 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_101| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_136| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_101|) v_ArrVal_675)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (or (let ((.cse4 (select .cse1 (+ .cse2 (- 4))))) (and (<= .cse4 2147483647) (<= 0 .cse4))) (<= c_~top~0 0)) (< (div .cse0 (- 4294967296)) (+ (div (+ 399 (* .cse0 (- 1))) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (let ((.cse5 (select .cse1 (+ .cse2 (- 8))))) (and (<= 0 .cse5) (<= .cse5 2147483647))) (< .cse3 8))))) is different from false