./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:34:02,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:34:02,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:34:02,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:34:02,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:34:02,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:34:02,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:34:02,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:34:02,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:34:02,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:34:02,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:34:02,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:34:02,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:34:02,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:34:02,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:34:02,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:34:02,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:34:02,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:34:02,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:34:02,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:34:02,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:34:02,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:34:02,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:34:02,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:34:02,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:34:02,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:34:02,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:34:02,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:34:02,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:34:02,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:34:02,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:34:02,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:34:02,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:34:02,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:34:02,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:34:02,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:34:02,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:34:02,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:34:02,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:34:02,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:34:02,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:34:02,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 00:34:02,513 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:34:02,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:34:02,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:34:02,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:34:02,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:34:02,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:34:02,517 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:34:02,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:34:02,517 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:34:02,518 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:34:02,519 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:34:02,519 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:34:02,520 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:34:02,520 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:34:02,520 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:34:02,521 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:34:02,521 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:34:02,521 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:34:02,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:34:02,523 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:34:02,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:34:02,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:34:02,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:34:02,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:34:02,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:34:02,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:34:02,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:34:02,525 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:34:02,525 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:34:02,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:34:02,526 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:34:02,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:34:02,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:34:02,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:34:02,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:02,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:34:02,528 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:34:02,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:34:02,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:34:02,529 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:34:02,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:34:02,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:34:02,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:34:02,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/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_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba 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 ! overflow) ) 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2022-11-22 00:34:02,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:34:02,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:34:02,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:34:02,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:34:02,913 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:34:02,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-11-22 00:34:05,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:34:06,316 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:34:06,319 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-11-22 00:34:06,337 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/data/a2371d3c6/ebc15c208af54a2e848b99e4b65cff64/FLAG922e21772 [2022-11-22 00:34:06,353 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/data/a2371d3c6/ebc15c208af54a2e848b99e4b65cff64 [2022-11-22 00:34:06,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:34:06,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:34:06,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:06,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:34:06,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:34:06,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:06" (1/1) ... [2022-11-22 00:34:06,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13caa0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:06, skipping insertion in model container [2022-11-22 00:34:06,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:34:06" (1/1) ... [2022-11-22 00:34:06,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:34:06,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:34:07,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:07,137 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:34:07,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:34:07,284 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:34:07,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07 WrapperNode [2022-11-22 00:34:07,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:34:07,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:07,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:34:07,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:34:07,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,370 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-22 00:34:07,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:34:07,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:34:07,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:34:07,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:34:07,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,436 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:34:07,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:34:07,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:34:07,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:34:07,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (1/1) ... [2022-11-22 00:34:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:34:07,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:07,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:34:07,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:34:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:34:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:34:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:34:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:34:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 00:34:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:34:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-22 00:34:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-22 00:34:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:34:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:34:07,550 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:34:07,805 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:34:07,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:34:08,055 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:34:08,063 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:34:08,063 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 00:34:08,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:08 BoogieIcfgContainer [2022-11-22 00:34:08,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:34:08,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:34:08,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:34:08,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:34:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:34:06" (1/3) ... [2022-11-22 00:34:08,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1eb072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:08, skipping insertion in model container [2022-11-22 00:34:08,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:34:07" (2/3) ... [2022-11-22 00:34:08,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1eb072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:34:08, skipping insertion in model container [2022-11-22 00:34:08,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:34:08" (3/3) ... [2022-11-22 00:34:08,077 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-11-22 00:34:08,087 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:34:08,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:34:08,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-11-22 00:34:08,098 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:34:08,179 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:34:08,232 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:34:08,249 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 98 transitions, 201 flow [2022-11-22 00:34:08,253 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 98 transitions, 201 flow [2022-11-22 00:34:08,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 201 flow [2022-11-22 00:34:08,332 INFO L130 PetriNetUnfolder]: 6/97 cut-off events. [2022-11-22 00:34:08,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:34:08,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 6/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-11-22 00:34:08,341 INFO L119 LiptonReduction]: Number of co-enabled transitions 2304 [2022-11-22 00:34:11,429 INFO L134 LiptonReduction]: Checked pairs total: 3191 [2022-11-22 00:34:11,429 INFO L136 LiptonReduction]: Total number of compositions: 95 [2022-11-22 00:34:11,441 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 27 transitions, 59 flow [2022-11-22 00:34:11,468 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 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) [2022-11-22 00:34:11,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:34:11,515 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@361222e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:34:11,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-22 00:34:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 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) [2022-11-22 00:34:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 00:34:11,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:11,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 00:34:11,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 12213, now seen corresponding path program 1 times [2022-11-22 00:34:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:11,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798264321] [2022-11-22 00:34:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:11,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798264321] [2022-11-22 00:34:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798264321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:11,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:11,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:34:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034497622] [2022-11-22 00:34:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:11,899 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-22 00:34:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:11,978 INFO L93 Difference]: Finished difference Result 102 states and 202 transitions. [2022-11-22 00:34:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-22 00:34:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:11,996 INFO L225 Difference]: With dead ends: 102 [2022-11-22 00:34:11,996 INFO L226 Difference]: Without dead ends: 102 [2022-11-22 00:34:11,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:12,002 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:12,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:34:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-22 00:34:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-22 00:34:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 2.58974358974359) internal successors, (202), 101 states have internal predecessors, (202), 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) [2022-11-22 00:34:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 202 transitions. [2022-11-22 00:34:12,083 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 202 transitions. Word has length 2 [2022-11-22 00:34:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:12,083 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 202 transitions. [2022-11-22 00:34:12,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-11-22 00:34:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 202 transitions. [2022-11-22 00:34:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 00:34:12,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:12,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 00:34:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:34:12,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 364363994, now seen corresponding path program 1 times [2022-11-22 00:34:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:12,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532029556] [2022-11-22 00:34:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:12,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:12,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532029556] [2022-11-22 00:34:12,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532029556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:12,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:12,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077250586] [2022-11-22 00:34:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:12,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:12,214 INFO L87 Difference]: Start difference. First operand 102 states and 202 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-22 00:34:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:12,295 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions. [2022-11-22 00:34:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-22 00:34:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:12,297 INFO L225 Difference]: With dead ends: 103 [2022-11-22 00:34:12,297 INFO L226 Difference]: Without dead ends: 103 [2022-11-22 00:34:12,298 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:34:12,299 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:12,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-22 00:34:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-22 00:34:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 2.569620253164557) internal successors, (203), 102 states have internal predecessors, (203), 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) [2022-11-22 00:34:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 203 transitions. [2022-11-22 00:34:12,310 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 203 transitions. Word has length 5 [2022-11-22 00:34:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:12,311 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 203 transitions. [2022-11-22 00:34:12,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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) [2022-11-22 00:34:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 203 transitions. [2022-11-22 00:34:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 00:34:12,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:12,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 00:34:12,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:34:12,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:12,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1594360943, now seen corresponding path program 1 times [2022-11-22 00:34:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:12,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121061464] [2022-11-22 00:34:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:12,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121061464] [2022-11-22 00:34:12,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121061464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:12,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649199609] [2022-11-22 00:34:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:12,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:12,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:12,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:12,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:34:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:12,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 00:34:12,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:12,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:12,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649199609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [395265049] [2022-11-22 00:34:12,651 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:34:12,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:12,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-11-22 00:34:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089995634] [2022-11-22 00:34:12,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:34:12,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:34:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:34:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:12,655 INFO L87 Difference]: Start difference. First operand 103 states and 203 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-22 00:34:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:12,749 INFO L93 Difference]: Finished difference Result 106 states and 206 transitions. [2022-11-22 00:34:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:34:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 [2022-11-22 00:34:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:12,753 INFO L225 Difference]: With dead ends: 106 [2022-11-22 00:34:12,755 INFO L226 Difference]: Without dead ends: 106 [2022-11-22 00:34:12,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:12,763 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:12,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-22 00:34:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-22 00:34:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 2.5121951219512195) internal successors, (206), 105 states have internal predecessors, (206), 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) [2022-11-22 00:34:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 206 transitions. [2022-11-22 00:34:12,785 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 206 transitions. Word has length 6 [2022-11-22 00:34:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:12,786 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 206 transitions. [2022-11-22 00:34:12,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-11-22 00:34:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 206 transitions. [2022-11-22 00:34:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:34:12,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:12,787 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-11-22 00:34:12,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 00:34:12,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:12,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 21771930, now seen corresponding path program 2 times [2022-11-22 00:34:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:12,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363376517] [2022-11-22 00:34:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:13,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:13,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363376517] [2022-11-22 00:34:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363376517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224902239] [2022-11-22 00:34:13,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:34:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:13,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:13,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:34:13,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 00:34:13,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:34:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 00:34:13,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:13,433 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:34:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:34:13,560 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:34:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 00:34:13,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:34:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224902239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:13,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:34:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-11-22 00:34:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329706762] [2022-11-22 00:34:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:34:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:34:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:34:13,603 INFO L87 Difference]: Start difference. First operand 106 states and 206 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-22 00:34:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:13,692 INFO L93 Difference]: Finished difference Result 146 states and 286 transitions. [2022-11-22 00:34:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:13,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 9 [2022-11-22 00:34:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:13,694 INFO L225 Difference]: With dead ends: 146 [2022-11-22 00:34:13,695 INFO L226 Difference]: Without dead ends: 146 [2022-11-22 00:34:13,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:34:13,703 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:13,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-22 00:34:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2022-11-22 00:34:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 2.5052631578947366) internal successors, (238), 118 states have internal predecessors, (238), 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) [2022-11-22 00:34:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 238 transitions. [2022-11-22 00:34:13,718 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 238 transitions. Word has length 9 [2022-11-22 00:34:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:13,719 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 238 transitions. [2022-11-22 00:34:13,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2022-11-22 00:34:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 238 transitions. [2022-11-22 00:34:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:34:13,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:13,727 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:13,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:13,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:13,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash 674930122, now seen corresponding path program 1 times [2022-11-22 00:34:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:13,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068963839] [2022-11-22 00:34:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:14,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068963839] [2022-11-22 00:34:14,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068963839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:14,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439352934] [2022-11-22 00:34:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:14,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:14,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:34:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 00:34:14,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:14,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:34:14,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439352934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1700820128] [2022-11-22 00:34:14,337 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:34:14,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:14,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-22 00:34:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713441597] [2022-11-22 00:34:14,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:34:14,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:34:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:34:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:34:14,344 INFO L87 Difference]: Start difference. First operand 119 states and 238 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) [2022-11-22 00:34:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:14,439 INFO L93 Difference]: Finished difference Result 125 states and 244 transitions. [2022-11-22 00:34:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 00:34:14,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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 10 [2022-11-22 00:34:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:14,441 INFO L225 Difference]: With dead ends: 125 [2022-11-22 00:34:14,442 INFO L226 Difference]: Without dead ends: 125 [2022-11-22 00:34:14,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:34:14,446 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-22 00:34:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-22 00:34:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 2.4158415841584158) internal successors, (244), 124 states have internal predecessors, (244), 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) [2022-11-22 00:34:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 244 transitions. [2022-11-22 00:34:14,471 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 244 transitions. Word has length 10 [2022-11-22 00:34:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:14,472 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 244 transitions. [2022-11-22 00:34:14,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) [2022-11-22 00:34:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 244 transitions. [2022-11-22 00:34:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:34:14,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:14,474 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:14,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:34:14,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:14,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1676027178, now seen corresponding path program 2 times [2022-11-22 00:34:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:14,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502069710] [2022-11-22 00:34:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:14,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502069710] [2022-11-22 00:34:14,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502069710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:14,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:14,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:34:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131456515] [2022-11-22 00:34:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:14,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:34:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:34:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:14,991 INFO L87 Difference]: Start difference. First operand 125 states and 244 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-11-22 00:34:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:15,120 INFO L93 Difference]: Finished difference Result 145 states and 278 transitions. [2022-11-22 00:34:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 [2022-11-22 00:34:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:15,123 INFO L225 Difference]: With dead ends: 145 [2022-11-22 00:34:15,123 INFO L226 Difference]: Without dead ends: 145 [2022-11-22 00:34:15,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:15,125 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:15,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-22 00:34:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-11-22 00:34:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.388888888888889) internal successors, (258), 131 states have internal predecessors, (258), 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) [2022-11-22 00:34:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 258 transitions. [2022-11-22 00:34:15,145 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 258 transitions. Word has length 16 [2022-11-22 00:34:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:15,146 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 258 transitions. [2022-11-22 00:34:15,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-11-22 00:34:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 258 transitions. [2022-11-22 00:34:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:34:15,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:15,148 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:34:15,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1676013650, now seen corresponding path program 1 times [2022-11-22 00:34:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:15,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301830534] [2022-11-22 00:34:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:15,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:15,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301830534] [2022-11-22 00:34:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301830534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:15,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:15,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:34:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530026532] [2022-11-22 00:34:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:34:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:34:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:34:15,458 INFO L87 Difference]: Start difference. First operand 132 states and 258 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-11-22 00:34:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:15,573 INFO L93 Difference]: Finished difference Result 135 states and 258 transitions. [2022-11-22 00:34:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:34:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 [2022-11-22 00:34:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:15,575 INFO L225 Difference]: With dead ends: 135 [2022-11-22 00:34:15,575 INFO L226 Difference]: Without dead ends: 135 [2022-11-22 00:34:15,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:15,577 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:15,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-22 00:34:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-11-22 00:34:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.3518518518518516) internal successors, (254), 131 states have internal predecessors, (254), 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) [2022-11-22 00:34:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 254 transitions. [2022-11-22 00:34:15,591 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 254 transitions. Word has length 16 [2022-11-22 00:34:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:15,591 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 254 transitions. [2022-11-22 00:34:15,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-11-22 00:34:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 254 transitions. [2022-11-22 00:34:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:34:15,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:15,594 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:15,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:34:15,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash 49390078, now seen corresponding path program 1 times [2022-11-22 00:34:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:15,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269238511] [2022-11-22 00:34:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:15,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269238511] [2022-11-22 00:34:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269238511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20457978] [2022-11-22 00:34:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:15,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:15,669 INFO L87 Difference]: Start difference. First operand 132 states and 254 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-11-22 00:34:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:15,741 INFO L93 Difference]: Finished difference Result 184 states and 357 transitions. [2022-11-22 00:34:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 18 [2022-11-22 00:34:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:15,743 INFO L225 Difference]: With dead ends: 184 [2022-11-22 00:34:15,744 INFO L226 Difference]: Without dead ends: 184 [2022-11-22 00:34:15,744 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:34:15,746 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 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 [2022-11-22 00:34:15,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-22 00:34:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2022-11-22 00:34:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 2.387323943661972) internal successors, (339), 165 states have internal predecessors, (339), 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) [2022-11-22 00:34:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 339 transitions. [2022-11-22 00:34:15,754 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 339 transitions. Word has length 18 [2022-11-22 00:34:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:15,755 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 339 transitions. [2022-11-22 00:34:15,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-11-22 00:34:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 339 transitions. [2022-11-22 00:34:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:34:15,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:15,757 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:15,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:34:15,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash 36370299, now seen corresponding path program 1 times [2022-11-22 00:34:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:15,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064073230] [2022-11-22 00:34:15,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:15,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:15,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064073230] [2022-11-22 00:34:15,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064073230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:15,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:15,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:34:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391717491] [2022-11-22 00:34:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:15,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:34:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:15,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:34:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:34:15,836 INFO L87 Difference]: Start difference. First operand 166 states and 339 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-11-22 00:34:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:15,924 INFO L93 Difference]: Finished difference Result 228 states and 464 transitions. [2022-11-22 00:34:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:34:15,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 18 [2022-11-22 00:34:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:15,927 INFO L225 Difference]: With dead ends: 228 [2022-11-22 00:34:15,927 INFO L226 Difference]: Without dead ends: 228 [2022-11-22 00:34:15,927 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:34:15,929 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 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 [2022-11-22 00:34:15,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-22 00:34:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 208. [2022-11-22 00:34:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 2.4130434782608696) internal successors, (444), 207 states have internal predecessors, (444), 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) [2022-11-22 00:34:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 444 transitions. [2022-11-22 00:34:15,941 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 444 transitions. Word has length 18 [2022-11-22 00:34:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:15,942 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 444 transitions. [2022-11-22 00:34:15,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-11-22 00:34:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 444 transitions. [2022-11-22 00:34:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:34:15,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:15,944 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:15,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:34:15,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1499463497, now seen corresponding path program 1 times [2022-11-22 00:34:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959693889] [2022-11-22 00:34:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:16,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:16,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959693889] [2022-11-22 00:34:16,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959693889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:34:16,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:34:16,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:34:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751401408] [2022-11-22 00:34:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:34:16,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:34:16,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:34:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:34:16,388 INFO L87 Difference]: Start difference. First operand 208 states and 444 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-11-22 00:34:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:34:16,543 INFO L93 Difference]: Finished difference Result 239 states and 504 transitions. [2022-11-22 00:34:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:34:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 19 [2022-11-22 00:34:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:34:16,545 INFO L225 Difference]: With dead ends: 239 [2022-11-22 00:34:16,545 INFO L226 Difference]: Without dead ends: 239 [2022-11-22 00:34:16,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:34:16,546 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:34:16,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:34:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-22 00:34:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 220. [2022-11-22 00:34:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 196 states have (on average 2.38265306122449) internal successors, (467), 219 states have internal predecessors, (467), 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) [2022-11-22 00:34:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 467 transitions. [2022-11-22 00:34:16,555 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 467 transitions. Word has length 19 [2022-11-22 00:34:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:34:16,556 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 467 transitions. [2022-11-22 00:34:16,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-11-22 00:34:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 467 transitions. [2022-11-22 00:34:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:34:16,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:34:16,557 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:34:16,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:34:16,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:34:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:34:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1531093417, now seen corresponding path program 1 times [2022-11-22 00:34:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:34:16,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670199447] [2022-11-22 00:34:16,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:34:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:17,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:34:17,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670199447] [2022-11-22 00:34:17,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670199447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:34:17,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900710845] [2022-11-22 00:34:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:34:17,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:34:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:34:17,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:34:17,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:34:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:34:17,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 00:34:17,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:34:17,239 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:34:17,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:34:17,335 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:34:17,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-22 00:34:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:22,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:34:26,717 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (v_ArrVal_305 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (v_ArrVal_306 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_305) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| v_ArrVal_306) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)))) is different from false [2022-11-22 00:34:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:34:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900710845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:34:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801819834] [2022-11-22 00:34:26,977 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:34:26,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:34:26,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-11-22 00:34:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092064966] [2022-11-22 00:34:26,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:34:26,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 00:34:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:34:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 00:34:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=154, Unknown=6, NotChecked=28, Total=272 [2022-11-22 00:34:26,980 INFO L87 Difference]: Start difference. First operand 220 states and 467 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2022-11-22 00:34:28,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:30,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:32,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:33,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:35,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:37,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:38,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:40,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:43,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:45,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:34:48,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:35:12,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:23,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:25,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:35,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:37,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:39,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:41,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:43,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:45,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:47,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:49,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:51,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:53,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:55,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:57,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:35:59,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:01,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:03,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:05,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:07,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:11,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:13,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:36:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:13,647 INFO L93 Difference]: Finished difference Result 361 states and 735 transitions. [2022-11-22 00:36:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 00:36:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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 19 [2022-11-22 00:36:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:13,650 INFO L225 Difference]: With dead ends: 361 [2022-11-22 00:36:13,650 INFO L226 Difference]: Without dead ends: 361 [2022-11-22 00:36:13,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=240, Invalid=444, Unknown=22, NotChecked=50, Total=756 [2022-11-22 00:36:13,651 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 40 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 65.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:13,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 271 Invalid, 34 Unknown, 52 Unchecked, 65.2s Time] [2022-11-22 00:36:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-22 00:36:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 218. [2022-11-22 00:36:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 194 states have (on average 2.329896907216495) internal successors, (452), 217 states have internal predecessors, (452), 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) [2022-11-22 00:36:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 452 transitions. [2022-11-22 00:36:13,660 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 452 transitions. Word has length 19 [2022-11-22 00:36:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:13,660 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 452 transitions. [2022-11-22 00:36:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 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) [2022-11-22 00:36:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 452 transitions. [2022-11-22 00:36:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:13,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:13,661 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:13,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:36:13,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:13,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -761271557, now seen corresponding path program 1 times [2022-11-22 00:36:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:13,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765259164] [2022-11-22 00:36:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:13,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:14,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765259164] [2022-11-22 00:36:14,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765259164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:14,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:14,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:36:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118350724] [2022-11-22 00:36:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:14,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:36:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:36:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:36:14,342 INFO L87 Difference]: Start difference. First operand 218 states and 452 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:14,738 INFO L93 Difference]: Finished difference Result 245 states and 496 transitions. [2022-11-22 00:36:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:36:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-11-22 00:36:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:14,740 INFO L225 Difference]: With dead ends: 245 [2022-11-22 00:36:14,740 INFO L226 Difference]: Without dead ends: 245 [2022-11-22 00:36:14,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:36:14,741 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:14,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:36:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-22 00:36:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 230. [2022-11-22 00:36:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 206 states have (on average 2.3058252427184467) internal successors, (475), 229 states have internal predecessors, (475), 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) [2022-11-22 00:36:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 475 transitions. [2022-11-22 00:36:14,750 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 475 transitions. Word has length 20 [2022-11-22 00:36:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:14,751 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 475 transitions. [2022-11-22 00:36:14,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 475 transitions. [2022-11-22 00:36:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:14,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:14,752 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:14,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:36:14,753 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -760452952, now seen corresponding path program 1 times [2022-11-22 00:36:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:14,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593730822] [2022-11-22 00:36:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:15,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:15,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593730822] [2022-11-22 00:36:15,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593730822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:15,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:36:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493578098] [2022-11-22 00:36:15,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:15,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:36:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:36:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:36:15,101 INFO L87 Difference]: Start difference. First operand 230 states and 475 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:15,446 INFO L93 Difference]: Finished difference Result 311 states and 631 transitions. [2022-11-22 00:36:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 00:36:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-11-22 00:36:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:15,449 INFO L225 Difference]: With dead ends: 311 [2022-11-22 00:36:15,449 INFO L226 Difference]: Without dead ends: 311 [2022-11-22 00:36:15,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:36:15,450 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:15,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:36:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-22 00:36:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 238. [2022-11-22 00:36:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 2.322429906542056) internal successors, (497), 237 states have internal predecessors, (497), 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) [2022-11-22 00:36:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 497 transitions. [2022-11-22 00:36:15,459 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 497 transitions. Word has length 20 [2022-11-22 00:36:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:15,459 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 497 transitions. [2022-11-22 00:36:15,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 497 transitions. [2022-11-22 00:36:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:15,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:15,461 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:15,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:36:15,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash -760452975, now seen corresponding path program 1 times [2022-11-22 00:36:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563944122] [2022-11-22 00:36:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:15,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563944122] [2022-11-22 00:36:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563944122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:15,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:15,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:36:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15612082] [2022-11-22 00:36:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:15,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:36:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:36:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:36:15,798 INFO L87 Difference]: Start difference. First operand 238 states and 497 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:16,064 INFO L93 Difference]: Finished difference Result 255 states and 516 transitions. [2022-11-22 00:36:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:36:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-11-22 00:36:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:16,066 INFO L225 Difference]: With dead ends: 255 [2022-11-22 00:36:16,066 INFO L226 Difference]: Without dead ends: 255 [2022-11-22 00:36:16,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:36:16,067 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:36:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-22 00:36:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2022-11-22 00:36:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 214 states have (on average 2.294392523364486) internal successors, (491), 237 states have internal predecessors, (491), 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) [2022-11-22 00:36:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 491 transitions. [2022-11-22 00:36:16,074 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 491 transitions. Word has length 20 [2022-11-22 00:36:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:16,075 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 491 transitions. [2022-11-22 00:36:16,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 491 transitions. [2022-11-22 00:36:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:16,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:16,076 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:16,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:36:16,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash -758466472, now seen corresponding path program 2 times [2022-11-22 00:36:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:16,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767149871] [2022-11-22 00:36:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:16,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767149871] [2022-11-22 00:36:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767149871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:16,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:16,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:36:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205015960] [2022-11-22 00:36:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:16,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:36:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:36:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:36:16,408 INFO L87 Difference]: Start difference. First operand 238 states and 491 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:16,761 INFO L93 Difference]: Finished difference Result 328 states and 660 transitions. [2022-11-22 00:36:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:36:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-11-22 00:36:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:16,764 INFO L225 Difference]: With dead ends: 328 [2022-11-22 00:36:16,764 INFO L226 Difference]: Without dead ends: 328 [2022-11-22 00:36:16,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:36:16,765 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:16,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:36:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-22 00:36:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 252. [2022-11-22 00:36:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 2.3026315789473686) internal successors, (525), 251 states have internal predecessors, (525), 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) [2022-11-22 00:36:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 525 transitions. [2022-11-22 00:36:16,773 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 525 transitions. Word has length 20 [2022-11-22 00:36:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:16,774 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 525 transitions. [2022-11-22 00:36:16,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 525 transitions. [2022-11-22 00:36:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:16,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:16,775 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:16,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:36:16,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:16,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -758466495, now seen corresponding path program 2 times [2022-11-22 00:36:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:16,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799379387] [2022-11-22 00:36:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:17,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:17,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799379387] [2022-11-22 00:36:17,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799379387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:36:17,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:36:17,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:36:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163432995] [2022-11-22 00:36:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:36:17,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:36:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:17,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:36:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:36:17,141 INFO L87 Difference]: Start difference. First operand 252 states and 525 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:36:17,473 INFO L93 Difference]: Finished difference Result 266 states and 538 transitions. [2022-11-22 00:36:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:36:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-11-22 00:36:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:36:17,475 INFO L225 Difference]: With dead ends: 266 [2022-11-22 00:36:17,475 INFO L226 Difference]: Without dead ends: 266 [2022-11-22 00:36:17,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:36:17,476 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:36:17,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:36:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-22 00:36:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2022-11-22 00:36:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 220 states have (on average 2.286363636363636) internal successors, (503), 243 states have internal predecessors, (503), 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) [2022-11-22 00:36:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 503 transitions. [2022-11-22 00:36:17,485 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 503 transitions. Word has length 20 [2022-11-22 00:36:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:36:17,485 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 503 transitions. [2022-11-22 00:36:17,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-11-22 00:36:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 503 transitions. [2022-11-22 00:36:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:36:17,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:36:17,489 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:36:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:36:17,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:36:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:36:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash 219255963, now seen corresponding path program 1 times [2022-11-22 00:36:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:36:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509132] [2022-11-22 00:36:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:36:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:17,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:36:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509132] [2022-11-22 00:36:17,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:36:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505455929] [2022-11-22 00:36:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:36:17,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:36:17,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:36:17,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:36:17,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:36:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:36:17,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 00:36:17,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:36:17,952 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:36:18,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:36:18,040 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:36:18,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-22 00:36:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:25,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:36:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:36:30,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505455929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:36:30,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817899000] [2022-11-22 00:36:30,034 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:36:30,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:36:30,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-22 00:36:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949269772] [2022-11-22 00:36:30,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:36:30,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 00:36:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:36:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 00:36:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=242, Unknown=12, NotChecked=0, Total=342 [2022-11-22 00:36:30,038 INFO L87 Difference]: Start difference. First operand 244 states and 503 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-11-22 00:36:31,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:33,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:35,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:37,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:39,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:41,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:43,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:45,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:47,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:53,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:55,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:57,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:36:59,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:01,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:03,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:05,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:07,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:09,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:11,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:15,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:19,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:37:20,427 INFO L93 Difference]: Finished difference Result 286 states and 564 transitions. [2022-11-22 00:37:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 00:37:20,428 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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 20 [2022-11-22 00:37:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:37:20,430 INFO L225 Difference]: With dead ends: 286 [2022-11-22 00:37:20,430 INFO L226 Difference]: Without dead ends: 286 [2022-11-22 00:37:20,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=155, Invalid=427, Unknown=18, NotChecked=0, Total=600 [2022-11-22 00:37:20,431 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:37:20,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 21 Unknown, 0 Unchecked, 42.1s Time] [2022-11-22 00:37:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-22 00:37:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 245. [2022-11-22 00:37:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 221 states have (on average 2.266968325791855) internal successors, (501), 244 states have internal predecessors, (501), 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) [2022-11-22 00:37:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 501 transitions. [2022-11-22 00:37:20,440 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 501 transitions. Word has length 20 [2022-11-22 00:37:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:37:20,440 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 501 transitions. [2022-11-22 00:37:20,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-11-22 00:37:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 501 transitions. [2022-11-22 00:37:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:37:20,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:37:20,441 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:37:20,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:37:20,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 00:37:20,648 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:37:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:37:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash 592144369, now seen corresponding path program 1 times [2022-11-22 00:37:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:37:20,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172665572] [2022-11-22 00:37:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:37:20,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:37:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:37:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:37:21,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:37:21,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172665572] [2022-11-22 00:37:21,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172665572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:37:21,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655424680] [2022-11-22 00:37:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:37:21,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:37:21,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:37:21,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:37:21,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:37:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:37:21,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 00:37:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:37:21,192 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:37:21,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:37:21,282 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:37:21,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-22 00:37:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:37:29,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:37:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:37:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655424680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:37:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [389018282] [2022-11-22 00:37:34,136 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:37:34,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:37:34,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-22 00:37:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386909351] [2022-11-22 00:37:34,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:37:34,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 00:37:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:37:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 00:37:34,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=243, Unknown=11, NotChecked=0, Total=342 [2022-11-22 00:37:34,140 INFO L87 Difference]: Start difference. First operand 245 states and 501 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-11-22 00:37:36,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:38,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:40,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:42,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:44,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:46,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:48,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:50,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:52,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:56,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:37:58,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:02,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:04,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:14,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:38:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:23,431 INFO L93 Difference]: Finished difference Result 284 states and 558 transitions. [2022-11-22 00:38:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 00:38:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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 20 [2022-11-22 00:38:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:23,434 INFO L225 Difference]: With dead ends: 284 [2022-11-22 00:38:23,434 INFO L226 Difference]: Without dead ends: 284 [2022-11-22 00:38:23,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=205, Invalid=476, Unknown=21, NotChecked=0, Total=702 [2022-11-22 00:38:23,435 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 19 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:23,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 356 Invalid, 14 Unknown, 0 Unchecked, 28.8s Time] [2022-11-22 00:38:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-22 00:38:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 240. [2022-11-22 00:38:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 217 states have (on average 2.2534562211981566) internal successors, (489), 239 states have internal predecessors, (489), 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) [2022-11-22 00:38:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 489 transitions. [2022-11-22 00:38:23,445 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 489 transitions. Word has length 20 [2022-11-22 00:38:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:23,445 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 489 transitions. [2022-11-22 00:38:23,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-11-22 00:38:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 489 transitions. [2022-11-22 00:38:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:38:23,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:23,446 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:23,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:23,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 00:38:23,655 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash 251590959, now seen corresponding path program 1 times [2022-11-22 00:38:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:23,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097127606] [2022-11-22 00:38:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 00:38:23,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097127606] [2022-11-22 00:38:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097127606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:38:23,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:38:23,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:38:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33239229] [2022-11-22 00:38:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:38:23,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:38:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:38:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:38:23,733 INFO L87 Difference]: Start difference. First operand 240 states and 489 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-22 00:38:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:23,801 INFO L93 Difference]: Finished difference Result 226 states and 457 transitions. [2022-11-22 00:38:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:38:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:38:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:23,803 INFO L225 Difference]: With dead ends: 226 [2022-11-22 00:38:23,803 INFO L226 Difference]: Without dead ends: 226 [2022-11-22 00:38:23,804 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:38:23,804 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:23,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:38:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-22 00:38:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-22 00:38:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 208 states have (on average 2.1971153846153846) internal successors, (457), 225 states have internal predecessors, (457), 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) [2022-11-22 00:38:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 457 transitions. [2022-11-22 00:38:23,812 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 457 transitions. Word has length 22 [2022-11-22 00:38:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:23,812 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 457 transitions. [2022-11-22 00:38:23,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-22 00:38:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 457 transitions. [2022-11-22 00:38:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:38:23,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:23,814 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:23,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 00:38:23,814 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash 251590960, now seen corresponding path program 1 times [2022-11-22 00:38:23,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:23,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994984276] [2022-11-22 00:38:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:23,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:23,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994984276] [2022-11-22 00:38:23,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994984276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:38:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662081701] [2022-11-22 00:38:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:38:23,893 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:38:23,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:38:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:24,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:38:24,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:38:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:24,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:38:24,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662081701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:38:24,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:38:24,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-22 00:38:24,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454481688] [2022-11-22 00:38:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:38:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:38:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:24,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:38:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:38:24,081 INFO L87 Difference]: Start difference. First operand 226 states and 457 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:24,188 INFO L93 Difference]: Finished difference Result 216 states and 425 transitions. [2022-11-22 00:38:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:38:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:38:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:24,190 INFO L225 Difference]: With dead ends: 216 [2022-11-22 00:38:24,191 INFO L226 Difference]: Without dead ends: 216 [2022-11-22 00:38:24,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:38:24,191 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:24,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:38:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-22 00:38:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2022-11-22 00:38:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 179 states have (on average 2.17877094972067) internal successors, (390), 191 states have internal predecessors, (390), 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) [2022-11-22 00:38:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 390 transitions. [2022-11-22 00:38:24,199 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 390 transitions. Word has length 22 [2022-11-22 00:38:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:24,200 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 390 transitions. [2022-11-22 00:38:24,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 390 transitions. [2022-11-22 00:38:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:38:24,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:24,202 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:24,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:24,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:24,409 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2115066289, now seen corresponding path program 1 times [2022-11-22 00:38:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:24,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218352830] [2022-11-22 00:38:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 00:38:24,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218352830] [2022-11-22 00:38:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218352830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:38:24,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:38:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:38:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775857772] [2022-11-22 00:38:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:38:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:38:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:38:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:38:24,470 INFO L87 Difference]: Start difference. First operand 192 states and 390 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:24,529 INFO L93 Difference]: Finished difference Result 182 states and 367 transitions. [2022-11-22 00:38:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:38:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:38:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:24,531 INFO L225 Difference]: With dead ends: 182 [2022-11-22 00:38:24,532 INFO L226 Difference]: Without dead ends: 182 [2022-11-22 00:38:24,532 INFO L412 NwaCegarLoop]: 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 [2022-11-22 00:38:24,533 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:24,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:38:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-22 00:38:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-11-22 00:38:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 172 states have (on average 2.133720930232558) internal successors, (367), 181 states have internal predecessors, (367), 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) [2022-11-22 00:38:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 367 transitions. [2022-11-22 00:38:24,539 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 367 transitions. Word has length 22 [2022-11-22 00:38:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:24,541 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 367 transitions. [2022-11-22 00:38:24,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 367 transitions. [2022-11-22 00:38:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:38:24,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:24,544 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 00:38:24,546 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2115066287, now seen corresponding path program 1 times [2022-11-22 00:38:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:24,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318285578] [2022-11-22 00:38:24,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:24,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318285578] [2022-11-22 00:38:24,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318285578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:38:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470819990] [2022-11-22 00:38:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:24,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:24,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:38:24,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:38:24,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:38:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:24,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:38:24,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:38:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:24,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:38:24,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470819990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:38:24,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:38:24,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-22 00:38:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066330947] [2022-11-22 00:38:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:38:24,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:38:24,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:38:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:38:24,852 INFO L87 Difference]: Start difference. First operand 182 states and 367 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:24,942 INFO L93 Difference]: Finished difference Result 174 states and 344 transitions. [2022-11-22 00:38:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:38:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:38:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:24,944 INFO L225 Difference]: With dead ends: 174 [2022-11-22 00:38:24,944 INFO L226 Difference]: Without dead ends: 174 [2022-11-22 00:38:24,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:38:24,945 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:24,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:38:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-22 00:38:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2022-11-22 00:38:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 2.0961538461538463) internal successors, (327), 162 states have internal predecessors, (327), 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) [2022-11-22 00:38:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 327 transitions. [2022-11-22 00:38:24,951 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 327 transitions. Word has length 22 [2022-11-22 00:38:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 327 transitions. [2022-11-22 00:38:24,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-22 00:38:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 327 transitions. [2022-11-22 00:38:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:38:24,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:24,954 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:24,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-22 00:38:25,160 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1142545557, now seen corresponding path program 1 times [2022-11-22 00:38:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808861917] [2022-11-22 00:38:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:25,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808861917] [2022-11-22 00:38:25,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808861917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:38:25,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007562339] [2022-11-22 00:38:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:25,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:25,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:38:25,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:38:25,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:38:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:26,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-22 00:38:26,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:38:26,268 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-22 00:38:26,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:38:26,445 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-22 00:38:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:26,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:38:28,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:38:28,830 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 21 [2022-11-22 00:38:28,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:38:28,843 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 26 [2022-11-22 00:38:28,856 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 5 [2022-11-22 00:38:28,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:38:28,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-22 00:38:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007562339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:38:28,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465603755] [2022-11-22 00:38:28,986 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:38:28,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:38:28,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-22 00:38:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621632607] [2022-11-22 00:38:28,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:38:28,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 00:38:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 00:38:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=490, Unknown=1, NotChecked=0, Total=600 [2022-11-22 00:38:28,990 INFO L87 Difference]: Start difference. First operand 163 states and 327 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 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) [2022-11-22 00:38:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:31,215 INFO L93 Difference]: Finished difference Result 281 states and 545 transitions. [2022-11-22 00:38:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-22 00:38:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 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 23 [2022-11-22 00:38:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:31,218 INFO L225 Difference]: With dead ends: 281 [2022-11-22 00:38:31,218 INFO L226 Difference]: Without dead ends: 281 [2022-11-22 00:38:31,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=469, Invalid=1692, Unknown=1, NotChecked=0, Total=2162 [2022-11-22 00:38:31,220 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 337 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:31,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-22 00:38:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-22 00:38:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2022-11-22 00:38:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 2.0987654320987654) internal successors, (340), 166 states have internal predecessors, (340), 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) [2022-11-22 00:38:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 340 transitions. [2022-11-22 00:38:31,227 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 340 transitions. Word has length 23 [2022-11-22 00:38:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:31,227 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 340 transitions. [2022-11-22 00:38:31,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 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) [2022-11-22 00:38:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 340 transitions. [2022-11-22 00:38:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:38:31,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:31,228 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:31,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 00:38:31,435 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1524763116, now seen corresponding path program 1 times [2022-11-22 00:38:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:31,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712614493] [2022-11-22 00:38:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:32,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:32,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712614493] [2022-11-22 00:38:32,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712614493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:38:32,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273473183] [2022-11-22 00:38:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:32,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:38:32,200 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:38:32,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 00:38:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:32,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:38:32,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:38:32,403 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:38:32,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:38:32,576 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:38:32,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-22 00:38:32,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-22 00:38:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:33,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:38:33,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| Int) (v_ArrVal_980 Int) (v_ArrVal_978 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_978) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_980) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180|) 2147483647))) is different from false [2022-11-22 00:38:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:33,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273473183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:38:33,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919902465] [2022-11-22 00:38:33,830 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:38:33,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:38:33,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-11-22 00:38:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585100810] [2022-11-22 00:38:33,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:38:33,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:38:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:38:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=636, Unknown=1, NotChecked=54, Total=870 [2022-11-22 00:38:33,834 INFO L87 Difference]: Start difference. First operand 167 states and 340 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:38:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:38:42,504 INFO L93 Difference]: Finished difference Result 407 states and 819 transitions. [2022-11-22 00:38:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-22 00:38:42,505 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:38:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:38:42,507 INFO L225 Difference]: With dead ends: 407 [2022-11-22 00:38:42,507 INFO L226 Difference]: Without dead ends: 389 [2022-11-22 00:38:42,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1049, Invalid=4504, Unknown=1, NotChecked=146, Total=5700 [2022-11-22 00:38:42,509 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 388 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:38:42,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 0 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 787 Invalid, 0 Unknown, 76 Unchecked, 3.0s Time] [2022-11-22 00:38:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-22 00:38:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 226. [2022-11-22 00:38:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 2.1900452488687785) internal successors, (484), 225 states have internal predecessors, (484), 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) [2022-11-22 00:38:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 484 transitions. [2022-11-22 00:38:42,520 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 484 transitions. Word has length 24 [2022-11-22 00:38:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:38:42,520 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 484 transitions. [2022-11-22 00:38:42,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:38:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 484 transitions. [2022-11-22 00:38:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:38:42,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:38:42,521 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:38:42,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:38:42,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 00:38:42,731 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:38:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:38:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1524761120, now seen corresponding path program 1 times [2022-11-22 00:38:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:38:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500351857] [2022-11-22 00:38:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:38:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:43,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:38:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500351857] [2022-11-22 00:38:43,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500351857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:38:43,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968391584] [2022-11-22 00:38:43,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:38:43,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:38:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:38:43,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:38:43,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 00:38:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:38:43,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:38:43,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:38:43,640 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:38:43,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:38:43,793 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:38:43,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:38:44,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-22 00:38:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:44,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:38:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:38:49,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968391584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:38:49,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [675450387] [2022-11-22 00:38:49,738 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:38:49,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:38:49,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-22 00:38:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622797432] [2022-11-22 00:38:49,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:38:49,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:38:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:38:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:38:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=699, Unknown=10, NotChecked=0, Total=870 [2022-11-22 00:38:49,742 INFO L87 Difference]: Start difference. First operand 226 states and 484 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:38:52,421 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse5))) (let ((.cse6 (store .cse1 .cse4 0))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (@diff .cse6 .cse5)) (.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (or (<= (+ .cse3 28) .cse0) (<= 0 (+ (select .cse1 .cse3) 2147483648))) (or (<= 0 (+ (select .cse1 .cse4) 2147483648)) (<= (+ 28 .cse4) .cse0)) (= .cse5 (store .cse6 .cse3 0)) (= .cse5 (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (<= 0 (+ (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))))) is different from false [2022-11-22 00:38:54,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse4))) (let ((.cse5 (store .cse2 .cse3 0)) (.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse9 |c_~#cache~0.offset|)) (.cse1 (@diff .cse5 .cse4)) (.cse7 (+ 28 |c_~#cache~0.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (or (<= (+ .cse1 28) .cse0) (<= 0 (+ (select .cse2 .cse1) 2147483648))) (or (<= 0 (+ (select .cse2 .cse3) 2147483648)) (<= (+ 28 .cse3) .cse0)) (= .cse4 (store .cse5 .cse1 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse2 .cse6 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse7))) (= .cse4 (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse7))) (<= 0 (+ (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ .cse9 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse6 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))))) is different from false [2022-11-22 00:38:55,479 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (exists ((v_ArrVal_1061 Int)) (= .cse1 (store .cse2 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 .cse3 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse4))) (= |c_~#cache~0.offset| 0) (= .cse2 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse4))) (<= 0 (+ (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse3 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:38:56,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse4))) (let ((.cse6 (store .cse2 .cse3 0)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse11 |c_~#cache~0.offset|)) (.cse1 (@diff .cse6 .cse4)) (.cse8 (+ 28 |c_~#cache~0.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse10 (+ .cse11 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (or (<= (+ .cse1 28) .cse0) (<= 0 (+ (select .cse2 .cse1) 2147483648))) (or (<= 0 (+ (select .cse2 .cse3) 2147483648)) (<= (+ 28 .cse3) .cse0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse4 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= .cse4 (store .cse6 .cse1 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse2 .cse7 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8))) (<= 0 (+ (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse10) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse7 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse10) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|)))))))))) is different from false [2022-11-22 00:38:57,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 ((as const (Array Int Int)) 0)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 (+ 28 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse7 (+ .cse0 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (exists ((v_ArrVal_1061 Int)) (= .cse1 (store .cse2 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= .cse2 (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 .cse4 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse5))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse5))) (<= 0 (+ (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse7) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse4 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse7) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|)))))))) is different from false [2022-11-22 00:38:59,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse4))) (let ((.cse6 (store .cse2 .cse3 0)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse11 |c_~#cache~0.offset|)) (.cse1 (@diff .cse6 .cse4)) (.cse8 (+ 28 |c_~#cache~0.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse10 (+ .cse11 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (or (<= (+ .cse1 28) .cse0) (<= 0 (+ (select .cse2 .cse1) 2147483648))) (or (<= 0 (+ (select .cse2 .cse3) 2147483648)) (<= (+ 28 .cse3) .cse0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse4 (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= .cse4 (store .cse6 .cse1 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse2 .cse7 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8))) (<= 0 (+ (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse10) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse7 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse10) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|)))))))))) is different from false [2022-11-22 00:39:06,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (let ((.cse6 (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse8 (+ .cse0 28 |c_~#cache~0.offset|)) (.cse7 (@diff .cse6 .cse2))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1061 Int)) (= .cse1 (store .cse2 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 .cse3 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse4))) (exists ((v_ArrVal_1061 Int)) (= .cse5 (store .cse2 0 v_ArrVal_1061))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse4))) (= (store .cse6 .cse7 0) .cse2) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse3 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse8) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))))) (or (<= 0 (+ (select .cse1 .cse7) 2147483648)) (= .cse2 .cse6)))))) is different from false [2022-11-22 00:39:09,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse5))) (let ((.cse7 (store .cse1 .cse4 0)) (.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse8 |c_~#cache~0.offset|)) (.cse3 (@diff .cse7 .cse5)) (.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (or (<= (+ .cse3 28) .cse0) (<= 0 (+ (select .cse1 .cse3) 2147483648))) (or (<= 0 (+ (select .cse1 .cse4) 2147483648)) (<= (+ 28 .cse4) .cse0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse5 (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= .cse5 (store .cse7 .cse3 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ .cse8 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|)))))))))) is different from false [2022-11-22 00:39:09,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_1061 Int)) (= .cse0 (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse0 .cse1 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse3) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) .cse1 v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse3) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))))))) is different from false [2022-11-22 00:39:16,373 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:39:16,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse4 (@diff .cse3 .cse2))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (exists ((v_ArrVal_1061 Int)) (= .cse1 (store .cse2 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= (store .cse3 .cse4 0) .cse2) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ .cse0 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))))) (or (<= 0 (+ (select .cse1 .cse4) 2147483648)) (= .cse2 .cse3)))))) is different from false [2022-11-22 00:39:16,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse2 ((as const (Array Int Int)) 0)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ .cse0 28 |c_~#cache~0.offset|)) (.cse5 (@diff .cse4 .cse2))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (exists ((v_ArrVal_1061 Int)) (= .cse1 (store .cse2 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= (store .cse4 .cse5 0) .cse2) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1060 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse6) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1060)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|) 2147483650)))) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse6) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1061)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))))) (or (<= 0 (+ (select .cse1 .cse5) 2147483648)) (= .cse2 .cse4)))))) is different from false [2022-11-22 00:39:19,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:23,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse5))) (let ((.cse6 (store .cse1 .cse4 0))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (@diff .cse6 .cse5)) (.cse2 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (or (<= (+ .cse3 28) .cse0) (<= 0 (+ (select .cse1 .cse3) 2147483648))) (or (<= 0 (+ (select .cse1 .cse4) 2147483648)) (<= (+ 28 .cse4) .cse0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse5 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= .cse5 (store .cse6 .cse3 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))))) is different from false [2022-11-22 00:39:35,431 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:39:37,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:38,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (exists ((v_ArrVal_1061 Int)) (= .cse0 (store .cse1 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= (store .cse2 .cse3 0) .cse1) (or (<= 0 (+ (select .cse0 .cse3) 2147483648)) (= .cse1 .cse2)))))) is different from false [2022-11-22 00:39:41,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:45,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:49,684 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse1 .cse5))) (let ((.cse6 (store .cse1 .cse4 0))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (@diff .cse6 .cse5)) (.cse2 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int)) (or (< 0 (+ 2147483650 (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (or (<= (+ .cse3 28) .cse0) (<= 0 (+ (select .cse1 .cse3) 2147483648))) (or (<= 0 (+ (select .cse1 .cse4) 2147483648)) (<= (+ 28 .cse4) .cse0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse5 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= .cse5 (store .cse6 .cse3 0)) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| .cse2))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))))))) is different from false [2022-11-22 00:39:55,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:39:57,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1061 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse0 |c_~#cache~0.offset| v_ArrVal_1061))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1061 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse0 0 v_ArrVal_1061))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1061 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1058 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1058) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1061) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (+ 28 |c_~#cache~0.offset|)))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2022-11-22 00:40:03,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:40:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:40:08,483 INFO L93 Difference]: Finished difference Result 1482 states and 3088 transitions. [2022-11-22 00:40:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-11-22 00:40:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:40:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:40:08,491 INFO L225 Difference]: With dead ends: 1482 [2022-11-22 00:40:08,492 INFO L226 Difference]: Without dead ends: 1482 [2022-11-22 00:40:08,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 6352 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=2839, Invalid=13642, Unknown=91, NotChecked=4020, Total=20592 [2022-11-22 00:40:08,497 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 743 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 284 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:40:08,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 0 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1902 Invalid, 56 Unknown, 360 Unchecked, 26.5s Time] [2022-11-22 00:40:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-11-22 00:40:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 543. [2022-11-22 00:40:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 538 states have (on average 2.4107806691449816) internal successors, (1297), 542 states have internal predecessors, (1297), 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) [2022-11-22 00:40:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1297 transitions. [2022-11-22 00:40:08,525 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1297 transitions. Word has length 24 [2022-11-22 00:40:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:40:08,525 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1297 transitions. [2022-11-22 00:40:08,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:40:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1297 transitions. [2022-11-22 00:40:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:40:08,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:40:08,527 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:40:08,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 00:40:08,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:40:08,733 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:40:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:40:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1526836857, now seen corresponding path program 1 times [2022-11-22 00:40:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:40:08,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302382998] [2022-11-22 00:40:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:40:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:40:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:40:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:09,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:40:09,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302382998] [2022-11-22 00:40:09,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302382998] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:40:09,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193489789] [2022-11-22 00:40:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:40:09,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:40:09,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:40:09,444 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:40:09,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 00:40:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:40:09,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:40:09,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:40:09,645 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:40:09,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:40:09,793 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:40:10,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:40:10,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:40:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:10,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:40:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:13,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193489789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:40:13,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859815936] [2022-11-22 00:40:13,420 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:40:13,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:40:13,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-22 00:40:13,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32054061] [2022-11-22 00:40:13,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:40:13,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:40:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:40:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:40:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=751, Unknown=9, NotChecked=0, Total=930 [2022-11-22 00:40:13,425 INFO L87 Difference]: Start difference. First operand 543 states and 1297 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:40:15,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1141 Int)) (= .cse0 (store .cse1 |c_~#cache~0.offset| v_ArrVal_1141))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| .cse2) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1140 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1140)) |c_~#cache~0.base|) .cse4 v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647))) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| .cse2) (< (select (store .cse0 .cse4 v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647))) (exists ((v_ArrVal_1141 Int)) (= .cse3 (store .cse1 0 v_ArrVal_1141))))) is different from false [2022-11-22 00:40:15,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse4 (+ .cse6 |c_~#cache~0.offset|)) (.cse5 (+ 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (exists ((v_ArrVal_1141 Int)) (= .cse3 (store .cse0 |c_~#cache~0.offset| v_ArrVal_1141))) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse4) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| .cse5) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (or (= .cse0 .cse1) (<= (+ .cse2 28) .cse4)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1140 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ .cse6 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1140)) |c_~#cache~0.base|) .cse7 v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| .cse5) (< (select (store .cse3 .cse7 v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647)))))) is different from false [2022-11-22 00:40:21,482 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= .cse0 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= .cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:40:24,798 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) is different from false [2022-11-22 00:40:30,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1140 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse0 |c_~#cache~0.offset| v_ArrVal_1140))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1141 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse0 0 v_ArrVal_1141))))) is different from false [2022-11-22 00:40:32,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1141 Int)) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse0 |c_~#cache~0.offset| v_ArrVal_1141))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_1141 Int) (v_ArrVal_1138 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1138) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1141) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_163| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1141 Int)) (= (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (store .cse0 0 v_ArrVal_1141))))) is different from false [2022-11-22 00:40:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:40:35,714 INFO L93 Difference]: Finished difference Result 1027 states and 2360 transitions. [2022-11-22 00:40:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-22 00:40:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:40:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:40:35,722 INFO L225 Difference]: With dead ends: 1027 [2022-11-22 00:40:35,723 INFO L226 Difference]: Without dead ends: 1017 [2022-11-22 00:40:35,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1783 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=904, Invalid=4777, Unknown=43, NotChecked=918, Total=6642 [2022-11-22 00:40:35,727 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 119 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-22 00:40:35,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1099 Invalid, 14 Unknown, 108 Unchecked, 4.8s Time] [2022-11-22 00:40:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-11-22 00:40:35,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 697. [2022-11-22 00:40:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 692 states have (on average 2.449421965317919) internal successors, (1695), 696 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) [2022-11-22 00:40:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1695 transitions. [2022-11-22 00:40:35,767 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1695 transitions. Word has length 24 [2022-11-22 00:40:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:40:35,767 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1695 transitions. [2022-11-22 00:40:35,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:40:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1695 transitions. [2022-11-22 00:40:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:40:35,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:40:35,770 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:40:35,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 00:40:35,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-22 00:40:35,978 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:40:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:40:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1552755050, now seen corresponding path program 2 times [2022-11-22 00:40:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:40:35,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478882226] [2022-11-22 00:40:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:40:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:40:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:40:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:36,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:40:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478882226] [2022-11-22 00:40:36,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478882226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:40:36,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183669639] [2022-11-22 00:40:36,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:40:36,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:40:36,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:40:36,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:40:36,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 00:40:36,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:40:36,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:40:36,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:40:36,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:40:36,871 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:40:37,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:40:37,026 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:40:37,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:40:37,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:40:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:37,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:40:38,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_165| Int) (v_ArrVal_1222 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1218) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1222) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_165|) 2147483650)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_165| (+ 28 |c_~#cache~0.offset|)))) is different from false [2022-11-22 00:40:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:40:38,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183669639] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:40:38,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125663967] [2022-11-22 00:40:38,490 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:40:38,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:40:38,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-22 00:40:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019296632] [2022-11-22 00:40:38,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:40:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:40:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:40:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:40:38,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=675, Unknown=1, NotChecked=54, Total=870 [2022-11-22 00:40:38,492 INFO L87 Difference]: Start difference. First operand 697 states and 1695 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:41:07,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:41:09,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:41:11,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:41:14,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:41:18,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:41:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:41:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:41:29,506 INFO L93 Difference]: Finished difference Result 2002 states and 4469 transitions. [2022-11-22 00:41:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-11-22 00:41:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:41:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:41:29,517 INFO L225 Difference]: With dead ends: 2002 [2022-11-22 00:41:29,518 INFO L226 Difference]: Without dead ends: 1991 [2022-11-22 00:41:29,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9945 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=4141, Invalid=20042, Unknown=1, NotChecked=308, Total=24492 [2022-11-22 00:41:29,524 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 709 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 284 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:41:29,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 0 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1500 Invalid, 7 Unknown, 83 Unchecked, 20.9s Time] [2022-11-22 00:41:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-11-22 00:41:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 653. [2022-11-22 00:41:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 648 states have (on average 2.45679012345679) internal successors, (1592), 652 states have internal predecessors, (1592), 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) [2022-11-22 00:41:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1592 transitions. [2022-11-22 00:41:29,559 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1592 transitions. Word has length 24 [2022-11-22 00:41:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:41:29,560 INFO L495 AbstractCegarLoop]: Abstraction has 653 states and 1592 transitions. [2022-11-22 00:41:29,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:41:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1592 transitions. [2022-11-22 00:41:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:41:29,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:41:29,572 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:41:29,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 00:41:29,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 00:41:29,783 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:41:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:41:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1553448625, now seen corresponding path program 1 times [2022-11-22 00:41:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:41:29,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810466453] [2022-11-22 00:41:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:41:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:41:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:41:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:41:30,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:41:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810466453] [2022-11-22 00:41:30,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810466453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:41:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076615357] [2022-11-22 00:41:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:41:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:41:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:41:30,686 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:41:30,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 00:41:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:41:30,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 00:41:30,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:41:30,900 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:41:31,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:41:31,068 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:41:31,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-11-22 00:41:31,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:41:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:41:31,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:41:41,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1301 Int) (v_ArrVal_1298 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_167| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1298) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1299) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1301) |c_~#cache~0.offset|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_167| (+ 28 |c_~#cache~0.offset|)) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1299)))) is different from false [2022-11-22 00:41:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:41:41,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076615357] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:41:41,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261610952] [2022-11-22 00:41:41,246 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:41:41,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:41:41,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-11-22 00:41:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006300220] [2022-11-22 00:41:41,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:41:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 00:41:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:41:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 00:41:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=899, Unknown=5, NotChecked=62, Total=1122 [2022-11-22 00:41:41,250 INFO L87 Difference]: Start difference. First operand 653 states and 1592 transitions. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:41:59,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:06,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:11,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:14,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:27,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:31,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:33,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:42:38,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:10,067 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 121 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:43:12,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:19,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:21,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:26,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:43:39,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:41,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:43,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:43:55,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:43:57,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:44:07,486 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 116 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:44:28,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:44:30,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:44:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:44:42,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:45:05,826 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:45:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:45:27,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:46:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:46:03,461 INFO L93 Difference]: Finished difference Result 904 states and 2129 transitions. [2022-11-22 00:46:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-22 00:46:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:46:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:46:03,465 INFO L225 Difference]: With dead ends: 904 [2022-11-22 00:46:03,465 INFO L226 Difference]: Without dead ends: 904 [2022-11-22 00:46:03,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 217.4s TimeCoverageRelationStatistics Valid=1684, Invalid=9835, Unknown=41, NotChecked=212, Total=11772 [2022-11-22 00:46:03,468 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 78 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 54.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:46:03,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1427 Invalid, 23 Unknown, 117 Unchecked, 54.5s Time] [2022-11-22 00:46:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-11-22 00:46:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 665. [2022-11-22 00:46:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 660 states have (on average 2.453030303030303) internal successors, (1619), 664 states have internal predecessors, (1619), 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) [2022-11-22 00:46:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1619 transitions. [2022-11-22 00:46:03,510 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1619 transitions. Word has length 24 [2022-11-22 00:46:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:46:03,510 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 1619 transitions. [2022-11-22 00:46:03,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:46:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1619 transitions. [2022-11-22 00:46:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:46:03,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:46:03,512 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:46:03,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 00:46:03,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 00:46:03,720 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:46:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:46:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1660772485, now seen corresponding path program 2 times [2022-11-22 00:46:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:46:03,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492805565] [2022-11-22 00:46:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:46:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:46:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:46:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:46:04,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:46:04,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492805565] [2022-11-22 00:46:04,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492805565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:46:04,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795687647] [2022-11-22 00:46:04,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:46:04,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:46:04,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:46:04,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:46:04,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 00:46:04,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:46:04,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:46:04,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 00:46:04,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:46:04,944 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:46:05,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:46:05,126 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:46:05,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-11-22 00:46:05,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:46:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:46:05,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:46:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:46:16,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795687647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:46:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [438642807] [2022-11-22 00:46:16,948 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:46:16,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:46:16,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-11-22 00:46:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348573711] [2022-11-22 00:46:16,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:46:16,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 00:46:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:46:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 00:46:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=903, Unknown=5, NotChecked=0, Total=1122 [2022-11-22 00:46:16,950 INFO L87 Difference]: Start difference. First operand 665 states and 1619 transitions. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:46:29,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 28 |c_~#cache~0.offset|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (@diff .cse2 .cse1))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (= .cse1 (store .cse2 .cse3 0)) (<= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 1) (forall ((v_ArrVal_1381 Int) (v_ArrVal_1380 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1378 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| Int)) (let ((.cse5 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1378) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (< (+ (select .cse5 |c_~#cache~0.offset|) 1) v_ArrVal_1380) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| .cse6) (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_1380) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| v_ArrVal_1381) |c_~#cache~0.offset|) 2147483647)))) (= .cse1 (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1381 Int) (v_ArrVal_1380 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| Int)) (or (< (+ (select .cse2 |c_~#cache~0.offset|) 1) v_ArrVal_1380) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| .cse6) (< (select (store (store .cse2 |c_~#cache~0.offset| v_ArrVal_1380) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| v_ArrVal_1381) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 2147483647))) (or (= .cse1 .cse2) (and (<= (+ 28 .cse3) .cse0) (<= (select .cse2 .cse3) 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-22 00:46:29,638 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse5 (@diff .cse4 .cse0)) (.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_1381 Int) (v_ArrVal_1380 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1378 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1378) |c_~#cache~0.base|))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1380) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1380) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_169| v_ArrVal_1381) |c_~#cache~0.offset|) 2147483647)))) (= .cse0 (store .cse4 .cse5 0)) (or (= .cse0 .cse4) (and (<= (select .cse4 .cse5) 1) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse5)))) (or (= .cse0 .cse1) (and (<= (+ 28 .cse2) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (<= (select .cse1 .cse2) 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-22 00:46:38,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:46:44,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:46:50,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:47:03,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:47:05,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:47:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:47:06,822 INFO L93 Difference]: Finished difference Result 932 states and 2209 transitions. [2022-11-22 00:47:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-22 00:47:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:47:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:47:06,825 INFO L225 Difference]: With dead ends: 932 [2022-11-22 00:47:06,825 INFO L226 Difference]: Without dead ends: 932 [2022-11-22 00:47:06,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=1147, Invalid=4970, Unknown=53, NotChecked=310, Total=6480 [2022-11-22 00:47:06,827 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 62 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:47:06,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1043 Invalid, 37 Unknown, 32 Unchecked, 16.0s Time] [2022-11-22 00:47:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-22 00:47:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 705. [2022-11-22 00:47:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 700 states have (on average 2.44) internal successors, (1708), 704 states have internal predecessors, (1708), 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) [2022-11-22 00:47:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1708 transitions. [2022-11-22 00:47:06,852 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1708 transitions. Word has length 24 [2022-11-22 00:47:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:47:06,853 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 1708 transitions. [2022-11-22 00:47:06,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1708 transitions. [2022-11-22 00:47:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:47:06,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:47:06,855 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:47:06,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 00:47:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-22 00:47:07,062 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:47:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:47:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1661591067, now seen corresponding path program 2 times [2022-11-22 00:47:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:47:07,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531593254] [2022-11-22 00:47:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:47:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:47:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:47:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:07,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:47:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531593254] [2022-11-22 00:47:07,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531593254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:47:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109893117] [2022-11-22 00:47:07,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:47:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:47:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:47:07,662 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:47:07,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 00:47:07,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:47:07,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:47:07,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:47:07,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:47:07,836 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:47:07,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:47:07,980 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:47:08,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:47:08,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:47:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:08,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:47:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:11,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109893117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:47:11,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2044455783] [2022-11-22 00:47:11,424 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:47:11,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:47:11,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-22 00:47:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143156025] [2022-11-22 00:47:11,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:47:11,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:47:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:47:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:47:11,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=769, Unknown=4, NotChecked=0, Total=930 [2022-11-22 00:47:11,426 INFO L87 Difference]: Start difference. First operand 705 states and 1708 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:47:16,672 INFO L93 Difference]: Finished difference Result 912 states and 2124 transitions. [2022-11-22 00:47:16,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 00:47:16,673 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:47:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:47:16,677 INFO L225 Difference]: With dead ends: 912 [2022-11-22 00:47:16,677 INFO L226 Difference]: Without dead ends: 901 [2022-11-22 00:47:16,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=375, Invalid=1873, Unknown=8, NotChecked=0, Total=2256 [2022-11-22 00:47:16,679 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 39 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:47:16,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 944 Invalid, 8 Unknown, 0 Unchecked, 3.1s Time] [2022-11-22 00:47:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-22 00:47:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 759. [2022-11-22 00:47:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 754 states have (on average 2.444297082228117) internal successors, (1843), 758 states have internal predecessors, (1843), 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) [2022-11-22 00:47:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1843 transitions. [2022-11-22 00:47:16,705 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1843 transitions. Word has length 24 [2022-11-22 00:47:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:47:16,705 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1843 transitions. [2022-11-22 00:47:16,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1843 transitions. [2022-11-22 00:47:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:47:16,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:47:16,707 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:47:16,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 00:47:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:47:16,915 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:47:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:47:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1663577547, now seen corresponding path program 3 times [2022-11-22 00:47:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:47:16,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75672799] [2022-11-22 00:47:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:47:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:47:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:47:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:17,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:47:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75672799] [2022-11-22 00:47:17,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75672799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:47:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016463689] [2022-11-22 00:47:17,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:47:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:47:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:47:17,613 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:47:17,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 00:47:17,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:47:17,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:47:17,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:47:17,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:47:17,813 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:47:17,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:47:18,000 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:47:18,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:47:18,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:47:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:18,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:47:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:23,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016463689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:47:23,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1670167108] [2022-11-22 00:47:23,673 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:47:23,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:47:23,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-22 00:47:23,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636349736] [2022-11-22 00:47:23,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:47:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:47:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:47:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:47:23,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=750, Unknown=3, NotChecked=0, Total=930 [2022-11-22 00:47:23,676 INFO L87 Difference]: Start difference. First operand 759 states and 1843 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:24,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_1539 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173| Int) (v_ArrVal_1542 Int)) (or (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1539)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1542) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1539 Int)) (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_1539) (select |c_#memory_int| |c_~#cache~0.base|))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1538 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173| Int) (v_ArrVal_1542 Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1538) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1542) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_173|) 2147483647))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1542 Int)) (= .cse0 (store .cse1 0 v_ArrVal_1542))))) is different from false [2022-11-22 00:47:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:47:30,942 INFO L93 Difference]: Finished difference Result 1087 states and 2541 transitions. [2022-11-22 00:47:30,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 00:47:30,943 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:47:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:47:30,947 INFO L225 Difference]: With dead ends: 1087 [2022-11-22 00:47:30,947 INFO L226 Difference]: Without dead ends: 1073 [2022-11-22 00:47:30,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=525, Invalid=2445, Unknown=4, NotChecked=106, Total=3080 [2022-11-22 00:47:30,948 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:47:30,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 0 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 831 Invalid, 2 Unknown, 4 Unchecked, 3.7s Time] [2022-11-22 00:47:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-11-22 00:47:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 844. [2022-11-22 00:47:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 839 states have (on average 2.469606674612634) internal successors, (2072), 843 states have internal predecessors, (2072), 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) [2022-11-22 00:47:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2072 transitions. [2022-11-22 00:47:30,982 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2072 transitions. Word has length 24 [2022-11-22 00:47:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:47:30,982 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 2072 transitions. [2022-11-22 00:47:30,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2072 transitions. [2022-11-22 00:47:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:47:30,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:47:30,985 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:47:30,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-22 00:47:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:47:31,191 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:47:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:47:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -608069718, now seen corresponding path program 2 times [2022-11-22 00:47:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:47:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376496151] [2022-11-22 00:47:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:47:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:47:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:47:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:31,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:47:31,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376496151] [2022-11-22 00:47:31,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376496151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:47:31,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887079981] [2022-11-22 00:47:31,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:47:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:47:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:47:31,942 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:47:31,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 00:47:32,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:47:32,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:47:32,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:47:32,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:47:32,120 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:47:32,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:47:32,264 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:47:32,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:47:32,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:47:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:32,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:47:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:47:37,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887079981] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:47:37,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1686072752] [2022-11-22 00:47:37,721 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:47:37,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:47:37,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2022-11-22 00:47:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221919585] [2022-11-22 00:47:37,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:47:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:47:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:47:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:47:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=711, Unknown=2, NotChecked=0, Total=870 [2022-11-22 00:47:37,725 INFO L87 Difference]: Start difference. First operand 844 states and 2072 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:47:41,638 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse2 .cse3))) (let ((.cse5 (store .cse2 .cse0 0)) (.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse4 |c_~#cache~0.offset|)) (.cse6 (@diff .cse5 .cse3))) (and (or (<= (+ 28 .cse0) .cse1) (<= (select .cse2 .cse0) 1)) (exists ((v_ArrVal_1619 Int)) (= (store .cse3 .cse1 v_ArrVal_1619) .cse2)) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ .cse4 28 |c_~#cache~0.offset|)) (< (select (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (= .cse3 (store .cse5 .cse6 0)) (or (<= (+ .cse6 28) .cse1) (<= (select .cse2 .cse6) 1)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))))) is different from false [2022-11-22 00:47:44,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:47:45,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse0) (< (select (store .cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse0) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1619 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1619) .cse1)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:47:48,099 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse1 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse0 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse0 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ .cse2 28 |c_~#cache~0.offset|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse2 |c_~#cache~0.offset|)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) is different from false [2022-11-22 00:47:57,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse0) (< (select (store .cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse0) (< (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1619 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1619) .cse1)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:48:03,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:07,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse9 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ .cse9 28 |c_~#cache~0.offset|)) (.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse8 (@diff .cse3 .cse7)) (.cse2 (+ .cse9 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse0 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse2) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse4) (< (select (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse4) (< (select (select (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse0 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse4))) (= .cse7 (store .cse3 .cse8 0)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse1) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (or (<= (+ .cse8 28) .cse2) (= .cse7 .cse3)) (<= (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)))) is different from false [2022-11-22 00:48:09,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:11,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:11,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1619 Int)) (= (store ((as const (Array Int Int)) 0) |c_~#cache~0.offset| v_ArrVal_1619) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (<= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:48:19,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:19,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse2 .cse7))) (let ((.cse8 (store .cse2 .cse0 0)) (.cse10 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse10 |c_~#cache~0.offset|)) (.cse9 (@diff .cse8 .cse7)) (.cse4 (+ .cse10 28 |c_~#cache~0.offset|)) (.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or (<= (+ 28 .cse0) .cse1) (<= (select .cse2 .cse0) 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse2 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse1) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse4) (< (select (select (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (= .cse7 (store .cse8 .cse9 0)) (or (<= (+ .cse9 28) .cse1) (<= (select .cse2 .cse9) 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< (select (store .cse2 |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse4))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| .cse3) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (<= (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))))) is different from false [2022-11-22 00:48:19,795 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((as const (Array Int Int)) 0))) (and (= |c_~#cache~0.base| 1) (forall ((v_ArrVal_1619 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1619)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1622))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_ArrVal_1619 Int)) (= (store .cse1 |c_~#cache~0.offset| v_ArrVal_1619) (select |c_#memory_int| |c_~#cache~0.base|))) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| Int) (v_ArrVal_1622 Int) (v_ArrVal_1618 (Array Int Int))) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1618) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1622) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_197| (+ 28 |c_~#cache~0.offset|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_~#cache~0.offset| 0) (exists ((v_ArrVal_1622 Int)) (= (store .cse1 0 v_ArrVal_1622) (select |c_#memory_int| 1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2022-11-22 00:48:25,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:33,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:48:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:48:36,080 INFO L93 Difference]: Finished difference Result 1495 states and 3439 transitions. [2022-11-22 00:48:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-22 00:48:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:48:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:48:36,087 INFO L225 Difference]: With dead ends: 1495 [2022-11-22 00:48:36,087 INFO L226 Difference]: Without dead ends: 1488 [2022-11-22 00:48:36,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4776 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=1989, Invalid=10609, Unknown=90, NotChecked=1832, Total=14520 [2022-11-22 00:48:36,090 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 143 mSolverCounterUnsat, 70 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 70 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:48:36,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1539 Invalid, 70 Unknown, 171 Unchecked, 25.1s Time] [2022-11-22 00:48:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-11-22 00:48:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 906. [2022-11-22 00:48:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 901 states have (on average 2.479467258601554) internal successors, (2234), 905 states have internal predecessors, (2234), 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) [2022-11-22 00:48:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2234 transitions. [2022-11-22 00:48:36,126 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2234 transitions. Word has length 24 [2022-11-22 00:48:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:48:36,126 INFO L495 AbstractCegarLoop]: Abstraction has 906 states and 2234 transitions. [2022-11-22 00:48:36,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:48:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2234 transitions. [2022-11-22 00:48:36,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:48:36,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:48:36,129 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:48:36,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-22 00:48:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-22 00:48:36,335 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:48:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:48:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1592230750, now seen corresponding path program 3 times [2022-11-22 00:48:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:48:36,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159991333] [2022-11-22 00:48:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:48:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:48:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:48:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:48:37,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:48:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159991333] [2022-11-22 00:48:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159991333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:48:37,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428747727] [2022-11-22 00:48:37,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:48:37,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:48:37,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:48:37,055 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:48:37,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 00:48:37,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:48:37,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:48:37,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 00:48:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:48:37,311 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:48:37,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:48:37,474 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-22 00:48:37,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-22 00:48:38,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 00:48:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:48:38,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:48:38,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1698 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| Int) (v_ArrVal_1701 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1698) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1701) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_200| (+ 28 |c_~#cache~0.offset|)))) is different from false [2022-11-22 00:48:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:48:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428747727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:48:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [246038828] [2022-11-22 00:48:39,057 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 00:48:39,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:48:39,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2022-11-22 00:48:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300551485] [2022-11-22 00:48:39,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:48:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:48:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:48:39,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:48:39,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=717, Unknown=1, NotChecked=56, Total=930 [2022-11-22 00:48:39,059 INFO L87 Difference]: Start difference. First operand 906 states and 2234 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:48:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:48:50,056 INFO L93 Difference]: Finished difference Result 1224 states and 2870 transitions. [2022-11-22 00:48:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-22 00:48:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:48:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:48:50,065 INFO L225 Difference]: With dead ends: 1224 [2022-11-22 00:48:50,065 INFO L226 Difference]: Without dead ends: 1221 [2022-11-22 00:48:50,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1067, Invalid=5256, Unknown=1, NotChecked=156, Total=6480 [2022-11-22 00:48:50,067 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:48:50,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1025 Invalid, 0 Unknown, 104 Unchecked, 4.4s Time] [2022-11-22 00:48:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2022-11-22 00:48:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 902. [2022-11-22 00:48:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 897 states have (on average 2.4782608695652173) internal successors, (2223), 901 states have internal predecessors, (2223), 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) [2022-11-22 00:48:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 2223 transitions. [2022-11-22 00:48:50,098 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 2223 transitions. Word has length 24 [2022-11-22 00:48:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:48:50,098 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 2223 transitions. [2022-11-22 00:48:50,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:48:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 2223 transitions. [2022-11-22 00:48:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:48:50,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:48:50,101 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:48:50,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-22 00:48:50,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:48:50,311 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-11-22 00:48:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:48:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1622503362, now seen corresponding path program 1 times [2022-11-22 00:48:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:48:50,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136488322] [2022-11-22 00:48:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:48:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:48:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:48:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 00:48:51,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:48:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136488322] [2022-11-22 00:48:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136488322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:48:51,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868100348] [2022-11-22 00:48:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:48:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:48:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:48:51,192 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:48:51,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be811b88-b580-4b9b-bda7-6f79631aded0/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 00:48:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:48:51,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 00:48:51,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:48:51,402 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-22 00:48:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:48:51,555 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15