./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- 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-4e7fbc6 [2022-11-23 14:24:41,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:24:41,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:24:41,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:24:41,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:24:41,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:24:41,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:24:41,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:24:41,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:24:41,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:24:41,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:24:41,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:24:41,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:24:41,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:24:41,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:24:41,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:24:41,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:24:41,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:24:41,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:24:41,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:24:41,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:24:41,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:24:41,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:24:41,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:24:41,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:24:41,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:24:41,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:24:41,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:24:41,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:24:41,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:24:41,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:24:41,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:24:41,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:24:41,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:24:41,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:24:41,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:24:41,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:24:41,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:24:41,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:24:41,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:24:41,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:24:41,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:24:41,463 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:24:41,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:24:41,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:24:41,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:24:41,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:24:41,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:24:41,465 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:24:41,466 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:24:41,466 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:24:41,466 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:24:41,466 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:24:41,467 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:24:41,467 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:24:41,467 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:24:41,467 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:24:41,468 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:24:41,468 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:24:41,468 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:24:41,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:24:41,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:24:41,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:24:41,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:24:41,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:24:41,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:24:41,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:24:41,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:24:41,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:24:41,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:24:41,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:24:41,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:24:41,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:24:41,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:24:41,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:24:41,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:24:41,473 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:24:41,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:24:41,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:24:41,474 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:24:41,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:24:41,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:24:41,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:24:41,475 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_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/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_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2022-11-23 14:24:41,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:24:41,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:24:41,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:24:41,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:24:41,802 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:24:41,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-11-23 14:24:44,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:24:45,126 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:24:45,126 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-11-23 14:24:45,133 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/data/809e254b4/1b41163f215b4c1ba3403cf8818b764e/FLAG932e36c36 [2022-11-23 14:24:45,148 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/data/809e254b4/1b41163f215b4c1ba3403cf8818b764e [2022-11-23 14:24:45,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:24:45,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:24:45,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:45,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:24:45,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:24:45,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e5e54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45, skipping insertion in model container [2022-11-23 14:24:45,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:24:45,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:24:45,399 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-11-23 14:24:45,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:45,411 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:24:45,430 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-11-23 14:24:45,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:45,445 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:24:45,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45 WrapperNode [2022-11-23 14:24:45,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:45,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:45,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:24:45,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:24:45,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,479 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2022-11-23 14:24:45,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:45,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:24:45,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:24:45,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:24:45,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,502 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:24:45,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:24:45,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:24:45,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:24:45,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (1/1) ... [2022-11-23 14:24:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:24:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:45,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:24:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:24:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:24:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-11-23 14:24:45,594 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-11-23 14:24:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:24:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:24:45,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:24:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:24:45,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:24:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:24:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:24:45,700 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:24:45,703 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:24:45,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:24:46,031 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:24:46,031 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 14:24:46,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:46 BoogieIcfgContainer [2022-11-23 14:24:46,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:24:46,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:24:46,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:24:46,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:24:46,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:24:45" (1/3) ... [2022-11-23 14:24:46,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b46cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:46, skipping insertion in model container [2022-11-23 14:24:46,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:45" (2/3) ... [2022-11-23 14:24:46,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b46cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:46, skipping insertion in model container [2022-11-23 14:24:46,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:46" (3/3) ... [2022-11-23 14:24:46,044 INFO L112 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2022-11-23 14:24:46,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:24:46,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 14:24:46,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:24:46,126 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;@4870123f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:24:46,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 14:24:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:24:46,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:46,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:46,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -93755173, now seen corresponding path program 1 times [2022-11-23 14:24:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:46,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014500913] [2022-11-23 14:24:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:24:46,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:46,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014500913] [2022-11-23 14:24:46,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014500913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:46,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:46,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:24:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178082880] [2022-11-23 14:24:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:46,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:46,647 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:24:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:46,701 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-11-23 14:24:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-11-23 14:24:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:46,712 INFO L225 Difference]: With dead ends: 33 [2022-11-23 14:24:46,712 INFO L226 Difference]: Without dead ends: 16 [2022-11-23 14:24:46,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:46,719 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:46,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-23 14:24:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-23 14:24:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-23 14:24:46,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 20 [2022-11-23 14:24:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:46,763 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-23 14:24:46,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 14:24:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-23 14:24:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:24:46,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:46,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:46,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:24:46,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 3079074, now seen corresponding path program 1 times [2022-11-23 14:24:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048723974] [2022-11-23 14:24:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:24:46,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:46,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048723974] [2022-11-23 14:24:46,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048723974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:46,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501093597] [2022-11-23 14:24:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:46,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:46,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:46,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:46,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:24:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:47,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:24:47,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 14:24:47,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501093597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-23 14:24:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799873214] [2022-11-23 14:24:47,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:47,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:47,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:47,072 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:24:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:47,115 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-23 14:24:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-11-23 14:24:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:47,117 INFO L225 Difference]: With dead ends: 29 [2022-11-23 14:24:47,117 INFO L226 Difference]: Without dead ends: 17 [2022-11-23 14:24:47,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:47,119 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:47,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-23 14:24:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-23 14:24:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-23 14:24:47,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 21 [2022-11-23 14:24:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:47,133 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-23 14:24:47,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:24:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-23 14:24:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:24:47,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:47,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:47,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 14:24:47,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-23 14:24:47,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1452369158, now seen corresponding path program 1 times [2022-11-23 14:24:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:47,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743302732] [2022-11-23 14:24:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 14:24:47,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743302732] [2022-11-23 14:24:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743302732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313970389] [2022-11-23 14:24:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:47,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:47,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:47,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:24:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:47,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:24:47,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 14:24:47,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313970389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:47,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:47,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-23 14:24:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620687512] [2022-11-23 14:24:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:47,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:47,624 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:24:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:47,662 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-11-23 14:24:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-23 14:24:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:47,665 INFO L225 Difference]: With dead ends: 27 [2022-11-23 14:24:47,665 INFO L226 Difference]: Without dead ends: 18 [2022-11-23 14:24:47,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:47,671 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:47,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-23 14:24:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-23 14:24:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-23 14:24:47,687 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2022-11-23 14:24:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:47,696 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-23 14:24:47,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:24:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-23 14:24:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:24:47,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:47,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:47,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 14:24:47,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:47,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1362806936, now seen corresponding path program 1 times [2022-11-23 14:24:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:47,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910077690] [2022-11-23 14:24:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 14:24:48,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910077690] [2022-11-23 14:24:48,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910077690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79237383] [2022-11-23 14:24:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:48,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:48,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:48,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:24:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:48,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:24:48,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 14:24:48,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 14:24:48,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79237383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:48,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353092060] [2022-11-23 14:24:48,317 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:48,317 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:48,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:48,330 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:48,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:48,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:48,476 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:24:48,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:24:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:48,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 14:24:48,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:48,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 14:24:48,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:48,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:48,682 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-23 14:24:48,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-23 14:24:48,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 16 treesize of output 12 [2022-11-23 14:24:48,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:48,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:24:49,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:49,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 14:24:49,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:49,293 INFO L321 Elim1Store]: treesize reduction 45, result has 34.8 percent of original size [2022-11-23 14:24:49,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2022-11-23 14:24:49,401 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 24 treesize of output 24 [2022-11-23 14:24:49,416 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 13 treesize of output 9 [2022-11-23 14:24:49,627 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:24:49,682 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:50,729 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '524#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:50,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:50,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:50,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-11-23 14:24:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46779850] [2022-11-23 14:24:50,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:50,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:24:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:24:50,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:24:50,731 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 14:24:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:50,766 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-11-23 14:24:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:24:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 25 [2022-11-23 14:24:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:50,768 INFO L225 Difference]: With dead ends: 36 [2022-11-23 14:24:50,768 INFO L226 Difference]: Without dead ends: 21 [2022-11-23 14:24:50,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:24:50,769 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:50,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-23 14:24:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 14:24:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-23 14:24:50,774 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2022-11-23 14:24:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:50,774 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-23 14:24:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 14:24:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-23 14:24:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 14:24:50,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:50,776 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:50,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:50,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:50,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -289862895, now seen corresponding path program 2 times [2022-11-23 14:24:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:50,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290990968] [2022-11-23 14:24:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 14:24:51,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:51,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290990968] [2022-11-23 14:24:51,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290990968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:51,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417115306] [2022-11-23 14:24:51,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:51,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:51,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:51,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:24:51,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:24:51,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:51,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:24:51,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 14:24:51,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 14:24:51,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417115306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:51,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [517057056] [2022-11-23 14:24:51,280 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:51,280 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:51,281 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:51,282 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:51,282 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:51,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,330 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:24:51,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:24:51,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 14:24:51,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-23 14:24:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,443 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-23 14:24:51,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-23 14:24:51,490 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 16 treesize of output 12 [2022-11-23 14:24:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:24:51,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:51,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-23 14:24:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:51,749 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-23 14:24:51,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-23 14:24:51,785 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 24 treesize of output 24 [2022-11-23 14:24:51,796 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 13 treesize of output 9 [2022-11-23 14:24:51,925 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:24:51,965 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:54,926 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '797#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:24:54,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:54,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:54,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 14:24:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261013853] [2022-11-23 14:24:54,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:54,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:24:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:24:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:24:54,928 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-23 14:24:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:54,963 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-11-23 14:24:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:24:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 28 [2022-11-23 14:24:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:54,964 INFO L225 Difference]: With dead ends: 38 [2022-11-23 14:24:54,964 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 14:24:54,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:24:54,965 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:54,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 14:24:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-23 14:24:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-23 14:24:54,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 28 [2022-11-23 14:24:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:54,970 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-23 14:24:54,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-23 14:24:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-23 14:24:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 14:24:54,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:54,971 INFO L195 NwaCegarLoop]: trace histogram [12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:54,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:55,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:55,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash 635166223, now seen corresponding path program 3 times [2022-11-23 14:24:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:55,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002796786] [2022-11-23 14:24:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-23 14:24:55,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002796786] [2022-11-23 14:24:55,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002796786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672915214] [2022-11-23 14:24:55,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:24:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:55,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:55,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:24:55,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:24:55,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:55,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:24:55,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-23 14:24:55,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-23 14:24:55,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672915214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:55,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1444775715] [2022-11-23 14:24:55,506 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:55,506 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:55,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:55,507 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:55,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:55,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,538 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:24:55,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:24:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 14:24:55,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-23 14:24:55,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,637 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-23 14:24:55,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-23 14:24:55,686 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 16 treesize of output 12 [2022-11-23 14:24:55,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:24:55,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:24:55,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-23 14:24:55,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:55,932 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-23 14:24:55,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-23 14:24:55,959 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 24 treesize of output 24 [2022-11-23 14:24:55,973 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 13 treesize of output 9 [2022-11-23 14:24:56,099 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:24:56,136 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:24:59,228 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1136#(and (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-23 14:24:59,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:24:59,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:59,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-11-23 14:24:59,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211663678] [2022-11-23 14:24:59,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:59,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:24:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:24:59,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:24:59,231 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 14:24:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:59,284 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-11-23 14:24:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:24:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 37 [2022-11-23 14:24:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:59,286 INFO L225 Difference]: With dead ends: 43 [2022-11-23 14:24:59,286 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 14:24:59,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:24:59,290 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:59,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:24:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 14:24:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-23 14:24:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:24:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-23 14:24:59,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 37 [2022-11-23 14:24:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:59,300 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-23 14:24:59,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 14:24:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-23 14:24:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 14:24:59,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:59,304 INFO L195 NwaCegarLoop]: trace histogram [15, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:59,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:59,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:59,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:24:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1550629485, now seen corresponding path program 4 times [2022-11-23 14:24:59,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994357192] [2022-11-23 14:24:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-23 14:24:59,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994357192] [2022-11-23 14:24:59,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994357192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659057004] [2022-11-23 14:24:59,669 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:24:59,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:59,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:59,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:24:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:59,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:24:59,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-23 14:24:59,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-23 14:24:59,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659057004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:59,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1290128918] [2022-11-23 14:24:59,848 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:24:59,849 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:24:59,849 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:24:59,849 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:24:59,849 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:24:59,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:59,880 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:24:59,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-23 14:24:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:59,906 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:24:59,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:24:59,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:59,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-23 14:24:59,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:59,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:59,991 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-23 14:24:59,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-23 14:25:00,028 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 16 treesize of output 12 [2022-11-23 14:25:00,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:00,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:25:00,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:00,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:25:00,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-23 14:25:00,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:00,238 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-23 14:25:00,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-23 14:25:00,263 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 24 treesize of output 24 [2022-11-23 14:25:00,275 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 13 treesize of output 9 [2022-11-23 14:25:00,379 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:25:00,408 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:03,393 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1512#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:25:03,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:03,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:25:03,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 8 [2022-11-23 14:25:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251066628] [2022-11-23 14:25:03,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:03,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:25:03,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:25:03,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-11-23 14:25:03,396 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 14:25:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:03,424 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-11-23 14:25:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:25:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2022-11-23 14:25:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:03,426 INFO L225 Difference]: With dead ends: 47 [2022-11-23 14:25:03,426 INFO L226 Difference]: Without dead ends: 27 [2022-11-23 14:25:03,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-11-23 14:25:03,427 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:03,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:25:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-23 14:25:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-23 14:25:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:25:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-23 14:25:03,432 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 41 [2022-11-23 14:25:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:03,432 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-23 14:25:03,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 14:25:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-23 14:25:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 14:25:03,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:03,433 INFO L195 NwaCegarLoop]: trace histogram [15, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:25:03,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:03,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 14:25:03,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -366315002, now seen corresponding path program 5 times [2022-11-23 14:25:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:03,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875980846] [2022-11-23 14:25:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:25:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-23 14:25:03,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875980846] [2022-11-23 14:25:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875980846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:25:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334327855] [2022-11-23 14:25:03,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:25:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:03,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:03,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:25:03,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:25:03,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:25:03,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:25:03,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-23 14:25:03,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:25:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-23 14:25:03,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334327855] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:25:03,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1221003151] [2022-11-23 14:25:03,946 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:25:03,946 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:25:03,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:25:03,947 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:25:03,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:25:03,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:03,980 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:25:03,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:25:03,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:03,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 14:25:04,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:04,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 14:25:04,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:04,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:25:04,070 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-23 14:25:04,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-23 14:25:04,127 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 16 treesize of output 12 [2022-11-23 14:25:04,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:04,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:25:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:04,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-23 14:25:04,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:04,308 INFO L321 Elim1Store]: treesize reduction 45, result has 34.8 percent of original size [2022-11-23 14:25:04,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2022-11-23 14:25:04,353 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 24 treesize of output 24 [2022-11-23 14:25:04,364 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 13 treesize of output 9 [2022-11-23 14:25:04,479 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:25:04,506 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:25:09,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1903#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (exists ((v_sum_~ret~0_BEFORE_RETURN_30 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_sum_~ret~0_BEFORE_RETURN_30 4294967296) 2147483647) (mod v_sum_~ret~0_BEFORE_RETURN_30 4294967296) (+ (mod v_sum_~ret~0_BEFORE_RETURN_30 4294967296) (- 4294967296))))) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:25:09,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:25:09,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:25:09,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-23 14:25:09,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601709433] [2022-11-23 14:25:09,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:25:09,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:25:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:25:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:25:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:25:09,457 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 14:25:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:25:09,488 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-11-23 14:25:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:25:09,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-11-23 14:25:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:25:09,490 INFO L225 Difference]: With dead ends: 42 [2022-11-23 14:25:09,490 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 14:25:09,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-23 14:25:09,491 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:25:09,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:25:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 14:25:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 14:25:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 14:25:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-23 14:25:09,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 42 [2022-11-23 14:25:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:25:09,496 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-23 14:25:09,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 14:25:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-23 14:25:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 14:25:09,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:25:09,498 INFO L195 NwaCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:25:09,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:25:09,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 14:25:09,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:25:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:25:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash 341118022, now seen corresponding path program 6 times [2022-11-23 14:25:09,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:25:09,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888884954] [2022-11-23 14:25:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:25:09,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:25:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:25:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 170 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 14:25:21,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:25:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888884954] [2022-11-23 14:25:21,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888884954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:25:21,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006624339] [2022-11-23 14:25:21,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:25:21,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:25:21,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:21,323 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:25:21,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:25:21,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:25:21,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:25:21,779 WARN L261 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 162 conjunts are in the unsatisfiable core [2022-11-23 14:25:21,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:25:21,843 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-23 14:25:22,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:24,103 INFO L321 Elim1Store]: treesize reduction 600, result has 38.2 percent of original size [2022-11-23 14:25:24,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 76 case distinctions, treesize of input 197 treesize of output 445 [2022-11-23 14:25:35,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:25:35,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 336 treesize of output 134 [2022-11-23 14:25:35,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:35,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:25:35,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 312 treesize of output 134 [2022-11-23 14:25:36,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:25:36,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2022-11-23 14:25:36,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:25:36,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2022-11-23 14:25:36,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:25:36,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:25:36,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 134 [2022-11-23 14:25:39,851 INFO L321 Elim1Store]: treesize reduction 352, result has 48.3 percent of original size [2022-11-23 14:25:39,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 10 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 420 treesize of output 476 [2022-11-23 14:27:04,265 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:04,364 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:04,499 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:04,654 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:04,782 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:04,809 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:04,995 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:05,144 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,348 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,375 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,425 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-23 14:27:05,450 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,469 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,514 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:05,604 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:05,762 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:05,979 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:06,241 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:06,394 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:06,425 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:06,670 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,032 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-23 14:27:07,164 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,184 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,230 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-23 14:27:07,251 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,272 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,327 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-23 14:27:07,445 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:07,644 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,716 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:07,746 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:07,987 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:08,241 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:08,439 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:08,616 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:08,761 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:09,206 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:09,406 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:11,395 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:12,194 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:12,738 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:12,751 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:12,760 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:12,877 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:13,062 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:13,203 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:13,510 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:15,478 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:16,309 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:16,411 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:16,414 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:16,460 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:16,516 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:17,323 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:19,400 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:19,604 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:20,328 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:20,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:20,480 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:20,493 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:20,502 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:20,611 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,031 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,288 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,336 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,460 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:21,463 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,535 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:21,594 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,008 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,124 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,209 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:22,335 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,358 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,679 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:22,999 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:23,012 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:23,023 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:23,166 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:23,593 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:24,438 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:25,311 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:25,847 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:25,850 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:25,958 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:26,963 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:28,550 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:29,874 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:30,952 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:31,084 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:31,511 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:31,632 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:34,415 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:34,573 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:34,973 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:35,035 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:35,048 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,072 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:35,248 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,401 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,466 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,641 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:35,647 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,713 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:35,891 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,118 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:36,125 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,278 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,293 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,339 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:36,419 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,534 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,770 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:36,968 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,977 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:36,986 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:37,145 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,376 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,630 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,699 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,826 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:37,830 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,886 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:37,939 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:38,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:38,546 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:38,599 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:38,708 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:38,808 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:39,218 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:40,929 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:42,116 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:42,208 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:42,212 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:42,266 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:42,326 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:43,697 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:45,253 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:47,960 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:49,022 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:49,031 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:49,041 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:49,184 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:49,372 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:49,737 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:50,092 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,423 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,532 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:50,538 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,598 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,734 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,786 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:50,793 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,867 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,881 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:50,907 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:50,973 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:51,004 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:52,130 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:52,138 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:52,147 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:52,242 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:52,318 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:52,386 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:52,924 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:53,729 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:54,540 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:54,549 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:54,557 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:54,815 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:55,003 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:55,719 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:27:55,722 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:55,830 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:56,564 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:57,568 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:58,798 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:59,420 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:59,478 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:27:59,966 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:00,123 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:00,744 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:00,952 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:01,889 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:02,524 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:05,685 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:06,860 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:07,101 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:07,105 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:07,198 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:07,286 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:08,771 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:13,094 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:19,121 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:20,184 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:20,195 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:20,206 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:20,512 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:20,741 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:21,466 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:21,476 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:21,487 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:21,658 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:21,923 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:22,271 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:22,414 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:22,543 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:22,547 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:22,628 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:22,713 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:23,749 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:23,837 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:23,937 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:24,026 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:24,053 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:24,084 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:24,255 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:25,709 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,556 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,565 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,575 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:26,655 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,723 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,867 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:26,870 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:26,939 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:27,779 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:29,127 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:30,419 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:31,703 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:31,839 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:32,325 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:32,422 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,125 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,210 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,682 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:33,685 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,742 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,838 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:33,883 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:33,888 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,046 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,059 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,086 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:34,142 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,175 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,278 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,287 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,296 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:34,454 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,580 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,604 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:34,805 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:38,010 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:39,169 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:40,037 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:40,050 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:40,059 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:40,264 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:40,521 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:41,017 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:41,474 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:44,467 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:45,673 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:45,872 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:45,877 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:46,122 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:46,199 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:48,181 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:51,850 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:52,067 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:52,123 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:52,137 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:52,147 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:52,309 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:52,796 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:53,435 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:53,478 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:53,704 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:53,708 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:53,770 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:53,864 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:54,806 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:54,945 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:54,991 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:55,137 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:55,193 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:55,232 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:55,565 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:55,578 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:55,588 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:55,799 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:56,041 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:56,089 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:56,244 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:56,249 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:56,301 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:56,426 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,067 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:57,072 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,179 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,195 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,229 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:57,322 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,353 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:57,439 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:58,199 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:58,490 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:59,105 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:59,120 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:59,130 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:28:59,306 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:28:59,466 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:00,433 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:01,144 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:01,253 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:29:01,257 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:01,387 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:02,386 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:03,885 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:05,053 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:05,991 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:06,223 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:06,925 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-23 14:29:07,132 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-23 14:29:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 14:29:31,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:29:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 14:29:35,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006624339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:29:35,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2047305033] [2022-11-23 14:29:35,815 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-23 14:29:35,815 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:29:35,816 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:29:35,816 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:29:35,816 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:29:35,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:35,844 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:29:35,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-23 14:29:35,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:35,876 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:29:35,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:29:35,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:35,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 14:29:35,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:35,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:29:35,968 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-23 14:29:35,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-23 14:29:36,028 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 16 treesize of output 12 [2022-11-23 14:29:36,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:36,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:29:36,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:36,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:29:36,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-23 14:29:36,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:29:36,203 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-23 14:29:36,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-23 14:29:36,228 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 24 treesize of output 24 [2022-11-23 14:29:36,238 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 13 treesize of output 9 [2022-11-23 14:29:36,330 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-23 14:29:36,351 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:29:41,104 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2360#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (exists ((v_sum_~ret~0_BEFORE_RETURN_36 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) 2147483647) (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) (+ (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) (- 4294967296))))) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:29:41,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:29:41,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:29:41,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 21] total 65 [2022-11-23 14:29:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372532388] [2022-11-23 14:29:41,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:29:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-23 14:29:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:29:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-23 14:29:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5719, Unknown=1, NotChecked=0, Total=6006 [2022-11-23 14:29:41,113 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-23 14:29:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:29:55,402 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-11-23 14:29:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 14:29:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 44 [2022-11-23 14:29:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:29:55,406 INFO L225 Difference]: With dead ends: 62 [2022-11-23 14:29:55,406 INFO L226 Difference]: Without dead ends: 46 [2022-11-23 14:29:55,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 75 SyntacticMatches, 19 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=362, Invalid=6443, Unknown=1, NotChecked=0, Total=6806 [2022-11-23 14:29:55,409 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:29:55,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 155 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1587 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-11-23 14:29:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-23 14:29:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-11-23 14:29:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-23 14:29:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-11-23 14:29:55,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 44 [2022-11-23 14:29:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:29:55,426 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-11-23 14:29:55,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-23 14:29:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-11-23 14:29:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 14:29:55,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:29:55,428 INFO L195 NwaCegarLoop]: trace histogram [16, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:29:55,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:29:55,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:29:55,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:29:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:29:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1425309922, now seen corresponding path program 7 times [2022-11-23 14:29:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:29:55,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902497055] [2022-11-23 14:29:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:29:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:29:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:29:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 16 proven. 91 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-23 14:29:55,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:29:55,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902497055] [2022-11-23 14:29:55,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902497055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:29:55,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363148190] [2022-11-23 14:29:55,778 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:29:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:29:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:29:55,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:29:55,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:29:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:29:55,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:29:55,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:29:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-11-23 14:29:55,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:29:55,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363148190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:29:55,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:29:55,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-11-23 14:29:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978921914] [2022-11-23 14:29:55,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:29:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:29:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:29:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:29:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:29:55,929 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:29:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:29:55,985 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-23 14:29:55,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:29:55,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-23 14:29:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:29:55,987 INFO L225 Difference]: With dead ends: 48 [2022-11-23 14:29:55,987 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 14:29:55,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:29:55,993 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:29:55,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:29:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 14:29:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 14:29:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-23 14:29:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 14:29:55,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-23 14:29:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:29:55,996 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 14:29:55,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 14:29:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 14:29:55,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 14:29:56,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 14:29:56,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:29:56,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:29:56,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 14:29:57,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 14:29:57,340 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-11-23 14:29:57,340 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-11-23 14:29:57,340 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (= |ULTIMATE.start_main_~#x~0#1.offset| 0) [2022-11-23 14:29:57,340 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (= |ULTIMATE.start_main_~#x~0#1.offset| 0) [2022-11-23 14:29:57,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 14:29:57,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2022-11-23 14:29:57,340 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-23 14:29:57,341 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) (.cse12 (+ .cse0 12 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse1 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse7 (+ 8 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse8 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse9 (+ 12 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse6 (let ((.cse14 (+ .cse0 8 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (let ((.cse13 (+ .cse0 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (store .cse4 (+ .cse0 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse4 .cse13)) .cse13 (select .cse4 .cse14))) .cse14 (select .cse4 .cse12))))) (and (= .cse0 16) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (let ((.cse2 (+ (select .cse4 0) (select .cse4 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) (select .cse4 12) (select .cse4 4) (select .cse4 8)))) (let ((.cse3 (* 4294967296 (div .cse2 4294967296)))) (or (and .cse1 (= .cse2 (+ |ULTIMATE.start_main_~ret~1#1| .cse3))) (= (+ |ULTIMATE.start_main_~ret~1#1| .cse3 4294967296) .cse2)))) (let ((.cse5 (mod (+ (select .cse6 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse6 .cse7) (select .cse6 .cse8) (select .cse6 .cse9) |ULTIMATE.start_main_~temp~0#1|) 4294967296))) (or (not (<= .cse5 2147483647)) (= |ULTIMATE.start_main_~ret~1#1| .cse5))) (let ((.cse10 (mod (let ((.cse11 (store .cse6 .cse12 (select .cse4 (+ .cse0 16 |ULTIMATE.start_main_~#x~0#1.offset|))))) (+ (select .cse11 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse11 .cse7) (select .cse11 .cse8) (select .cse11 .cse9) |ULTIMATE.start_main_~temp~0#1|)) 4294967296))) (or (<= .cse10 2147483647) (and (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse10) .cse1))))))) [2022-11-23 14:29:57,341 INFO L902 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-11-23 14:29:57,341 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-11-23 14:29:57,341 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse1 (select .cse6 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (.cse2 (select .cse6 12)) (.cse3 (select .cse6 8)) (.cse4 (select .cse6 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse5 (select .cse6 16))) (let ((.cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5))) (let ((.cse7 (* (div .cse0 4294967296) 4294967296))) (and (or (<= .cse0 (+ 4294967295 (* (div (+ (- 2147483648) .cse1 .cse2 .cse3 .cse4 .cse5) 4294967296) 4294967296))) (= (+ .cse1 (select .cse6 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) .cse2 .cse3 .cse4) (+ |ULTIMATE.start_main_~ret~1#1| .cse7))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (or (<= .cse0 (+ 2147483647 .cse7)) (= .cse0 (+ |ULTIMATE.start_main_~ret~1#1| .cse7 4294967296)))))))) [2022-11-23 14:29:57,341 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-23 14:29:57,342 INFO L895 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse16 (+ 12 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse14 (+ 8 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse20 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) (.cse15 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse5 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse0 (select .cse20 .cse15)) (.cse7 (select .cse20 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|))) (.cse1 (select .cse20 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~#x~0#1.offset| 0)) (.cse6 (select .cse20 .cse14)) (.cse8 (select .cse20 .cse16))) (or (and (= .cse0 .cse1) (= |ULTIMATE.start_main_~i~2#1| 1) .cse2 (let ((.cse3 (+ .cse6 .cse0 .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse4 (* (div .cse3 4294967296) 4294967296))) (or (and (<= .cse3 (+ 2147483647 .cse4)) .cse5 (= .cse3 (+ |ULTIMATE.start_main_~ret~1#1| .cse4))) (and .cse5 (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1|) 4294967296)))) (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296 .cse4) .cse3)))))) (and (= .cse6 .cse0) .cse2 (let ((.cse9 (+ .cse0 .cse7 .cse8 .cse1 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse10 (* (div .cse9 4294967296) 4294967296))) (or (and (<= .cse9 (+ 2147483647 .cse10)) .cse5 (= (+ |ULTIMATE.start_main_~ret~1#1| .cse10) .cse9)) (and .cse5 (<= .cse9 (+ (* (div (+ (- 2147483648) .cse0 .cse7 .cse8 .cse1 |ULTIMATE.start_main_~temp~0#1|) 4294967296) 4294967296) 4294967295)) (= (+ |ULTIMATE.start_main_~ret~1#1| .cse10 4294967296) .cse9))))) (= 2 |ULTIMATE.start_main_~i~2#1|)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse19 (+ .cse11 12 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse13 (let ((.cse22 (+ .cse11 8 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (let ((.cse21 (+ .cse11 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (store .cse20 (+ .cse11 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse20 .cse21)) .cse21 (select .cse20 .cse22))) .cse22 (select .cse20 .cse19))))) (and (= .cse7 .cse8) (= .cse11 16) .cse2 (let ((.cse12 (mod (+ (select .cse13 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse13 .cse14) (select .cse13 .cse15) (select .cse13 .cse16) |ULTIMATE.start_main_~temp~0#1|) 4294967296))) (or (not (<= .cse12 2147483647)) (and (= |ULTIMATE.start_main_~ret~1#1| .cse12) .cse5))) (let ((.cse17 (mod (let ((.cse18 (store .cse13 .cse19 (select .cse20 (+ .cse11 16 |ULTIMATE.start_main_~#x~0#1.offset|))))) (+ (select .cse18 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse18 .cse14) (select .cse18 .cse15) (select .cse18 .cse16) |ULTIMATE.start_main_~temp~0#1|)) 4294967296))) (or (<= .cse17 2147483647) (and (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse17) .cse5))))))) (and (let ((.cse23 (+ .cse6 .cse0 .cse7 .cse8 .cse1))) (let ((.cse24 (* (div .cse23 4294967296) 4294967296))) (or (and (= .cse23 (+ |ULTIMATE.start_main_~ret~1#1| 4294967296 .cse24)) .cse5 (<= .cse23 (+ 4294967295 (* (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse8 .cse1) 4294967296) 4294967296)))) (and .cse5 (= .cse23 (+ |ULTIMATE.start_main_~ret~1#1| .cse24)) (<= .cse23 (+ 2147483647 .cse24)))))) (= |ULTIMATE.start_main_~i~2#1| 0) .cse2 (= .cse1 |ULTIMATE.start_main_~temp~0#1|)) (and (let ((.cse25 (+ .cse6 .cse0 .cse7 .cse1 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse26 (* 4294967296 (div .cse25 4294967296)))) (or (and (<= .cse25 (+ 2147483647 .cse26)) .cse5 (= (+ .cse26 |ULTIMATE.start_main_~ret~1#1|) .cse25)) (and (<= .cse25 (+ (* (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse1 |ULTIMATE.start_main_~temp~0#1|) 4294967296) 4294967296) 4294967295)) .cse5 (= (+ .cse26 |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse25))))) (= 3 |ULTIMATE.start_main_~i~2#1|) .cse2 (= .cse6 .cse8))))) [2022-11-23 14:29:57,342 INFO L899 garLoopResultBuilder]: For program point sumEXIT(lines 15 24) no Hoare annotation was computed. [2022-11-23 14:29:57,342 INFO L902 garLoopResultBuilder]: At program point sumENTRY(lines 15 24) the Hoare annotation is: true [2022-11-23 14:29:57,343 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse5 (select |#memory_int| sum_~x.base))) (let ((.cse3 (select .cse5 (+ sum_~x.offset 4))) (.cse4 (select .cse5 sum_~x.offset)) (.cse0 (<= |sum_#in~x.offset| sum_~x.offset)) (.cse6 (select .cse5 (+ sum_~x.offset (- 4) (* sum_~i~0 4)))) (.cse1 (<= sum_~x.offset |sum_#in~x.offset|)) (.cse2 (= |sum_#in~x.base| sum_~x.base))) (or (and .cse0 .cse1 .cse2 (= sum_~i~0 2) (= sum_~ret~0 (+ .cse3 .cse4))) (and .cse0 (= sum_~i~0 4) .cse1 .cse2 (= sum_~ret~0 (+ (select .cse5 (+ sum_~x.offset 8)) .cse3 (select .cse5 (+ sum_~x.offset 12)) .cse4))) (and .cse0 .cse1 (= (+ .cse6 .cse3 .cse4) sum_~ret~0) (= sum_~i~0 3) .cse2) (and .cse0 (= sum_~ret~0 0) (= sum_~i~0 0) .cse1 .cse2) (and (<= 5 sum_~i~0) (exists ((sum_~x.offset Int)) (and (<= |sum_#in~x.offset| sum_~x.offset) (<= sum_~x.offset |sum_#in~x.offset|) (= sum_~ret~0 (let ((.cse7 (select |#memory_int| |sum_#in~x.base|))) (+ (select .cse7 (+ sum_~x.offset 8)) (select .cse7 (+ sum_~x.offset 16)) (select .cse7 sum_~x.offset) (select .cse7 (+ sum_~x.offset 4)) (select .cse7 (+ sum_~x.offset 12)))))))) (and .cse0 (= .cse6 sum_~ret~0) .cse1 (= sum_~i~0 1) .cse2)))) [2022-11-23 14:29:57,346 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-23 14:29:57,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:29:57,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:29:57 BoogieIcfgContainer [2022-11-23 14:29:57,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:29:57,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:29:57,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:29:57,430 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:29:57,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:46" (3/4) ... [2022-11-23 14:29:57,434 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 14:29:57,441 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2022-11-23 14:29:57,447 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-23 14:29:57,447 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-23 14:29:57,447 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 14:29:57,448 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 14:29:57,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((#in~x <= x && x <= #in~x) && #in~x == x) && i == 2) && ret == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) || ((((#in~x <= x && i == 4) && x <= #in~x) && #in~x == x) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x])) || ((((#in~x <= x && x <= #in~x) && unknown-#memory_int-unknown[x][x + -4 + i * 4] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] == ret) && i == 3) && #in~x == x)) || ((((#in~x <= x && ret == 0) && i == 0) && x <= #in~x) && #in~x == x)) || (5 <= i && (\exists sum_~x.offset : int :: (#in~x <= sum_~x.offset && sum_~x.offset <= #in~x) && ret == unknown-#memory_int-unknown[#in~x][sum_~x.offset + 8] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 16] + unknown-#memory_int-unknown[#in~x][sum_~x.offset] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 4] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 12]))) || ((((#in~x <= x && unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && x <= #in~x) && i == 1) && #in~x == x) [2022-11-23 14:29:57,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:29:57,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:29:57,495 INFO L158 Benchmark]: Toolchain (without parser) took 312342.32ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 137.4MB in the beginning and 267.0MB in the end (delta: -129.6MB). Peak memory consumption was 363.8MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,495 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:29:57,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.69ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 138.9MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.11ms. Allocated memory is still 172.0MB. Free memory was 138.2MB in the beginning and 136.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:29:57,496 INFO L158 Benchmark]: Boogie Preprocessor took 25.27ms. Allocated memory is still 172.0MB. Free memory was 136.8MB in the beginning and 135.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,497 INFO L158 Benchmark]: RCFGBuilder took 527.65ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 121.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,497 INFO L158 Benchmark]: TraceAbstraction took 311392.66ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 120.6MB in the beginning and 270.2MB in the end (delta: -149.6MB). Peak memory consumption was 344.8MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,498 INFO L158 Benchmark]: Witness Printer took 65.04ms. Allocated memory is still 664.8MB. Free memory was 270.2MB in the beginning and 267.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:29:57,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.69ms. Allocated memory is still 172.0MB. Free memory was 137.4MB in the beginning and 138.9MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.11ms. Allocated memory is still 172.0MB. Free memory was 138.2MB in the beginning and 136.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.27ms. Allocated memory is still 172.0MB. Free memory was 136.8MB in the beginning and 135.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.65ms. Allocated memory is still 172.0MB. Free memory was 135.3MB in the beginning and 121.4MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 311392.66ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 120.6MB in the beginning and 270.2MB in the end (delta: -149.6MB). Peak memory consumption was 344.8MB. Max. memory is 16.1GB. * Witness Printer took 65.04ms. Allocated memory is still 664.8MB. Free memory was 270.2MB in the beginning and 267.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 311.2s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1788 IncrementalHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 113 mSDtfsCounter, 1788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 595 SyntacticMatches, 31 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 42.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=9, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 52 PreInvPairs, 84 NumberOfFragments, 3978 HoareAnnotationTreeSize, 52 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 267.0s InterpolantComputationTime, 634 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 826 ConstructedInterpolants, 8 QuantifiedInterpolants, 14810 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 1911/2607 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2022-11-23 14:29:57,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,510 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,511 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,513 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-23 14:29:57,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] Derived loop invariant: ((((((((#in~x <= x && x <= #in~x) && #in~x == x) && i == 2) && ret == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) || ((((#in~x <= x && i == 4) && x <= #in~x) && #in~x == x) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x])) || ((((#in~x <= x && x <= #in~x) && unknown-#memory_int-unknown[x][x + -4 + i * 4] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] == ret) && i == 3) && #in~x == x)) || ((((#in~x <= x && ret == 0) && i == 0) && x <= #in~x) && #in~x == x)) || (5 <= i && (\exists sum_~x.offset : int :: (#in~x <= sum_~x.offset && sum_~x.offset <= #in~x) && ret == unknown-#memory_int-unknown[#in~x][sum_~x.offset + 8] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 16] + unknown-#memory_int-unknown[#in~x][sum_~x.offset] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 4] + unknown-#memory_int-unknown[#in~x][sum_~x.offset + 12]))) || ((((#in~x <= x && unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && x <= #in~x) && i == 1) && #in~x == x) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[x][4 + x] == unknown-#memory_int-unknown[x][x] && i == 1) && x == 0) && (((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp <= 2147483647 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296 && ret2 == ret) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp == ret + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296) || ((ret2 == ret && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp <= 4294967295 + 4294967296 * ((-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296)) && ret + 4294967296 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp))) || (((unknown-#memory_int-unknown[x][8 + x] == unknown-#memory_int-unknown[x][4 + x] && x == 0) && (((unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp <= 2147483647 + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 && ret2 == ret) && ret + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) || ((ret2 == ret && unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp <= (-2147483648 + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967295) && ret + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp))) && 2 == i)) || ((((unknown-#memory_int-unknown[x][16 + x] == unknown-#memory_int-unknown[x][12 + x] && i * 4 == 16) && x == 0) && (!((unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][12 + x] + temp) % 4294967296 <= 2147483647) || (ret == (unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][12 + x] + temp) % 4294967296 && ret2 == ret))) && ((unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][12 + x] + temp) % 4294967296 <= 2147483647 || (ret + 4294967296 == (unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][12 + x] + temp) % 4294967296 && ret2 == ret)))) || ((((((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] == ret + 4294967296 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296 && ret2 == ret) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] <= 4294967295 + (-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296) || ((ret2 == ret && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] == ret + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] <= 2147483647 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296)) && i == 0) && x == 0) && unknown-#memory_int-unknown[x][x] == temp)) || ((((((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp <= 2147483647 + 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) && ret2 == ret) && 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) + ret == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) || ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp <= (-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967295 && ret2 == ret) && 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp)) && 3 == i) && x == 0) && unknown-#memory_int-unknown[x][8 + x] == unknown-#memory_int-unknown[x][12 + x]) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: x == 0 RESULT: Ultimate proved your program to be correct! [2022-11-23 14:29:57,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f2bc287-08e0-434d-9972-f024a54792c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE