./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af --- 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-38b53e6 [2022-11-25 23:35:38,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:35:38,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:35:38,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:35:38,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:35:38,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:35:38,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:35:38,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:35:38,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:35:38,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:35:38,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:35:38,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:35:38,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:35:38,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:35:38,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:35:38,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:35:38,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:35:38,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:35:38,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:35:38,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:35:38,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:35:38,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:35:38,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:35:38,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:35:38,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:35:38,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:35:38,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:35:38,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:35:38,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:35:38,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:35:38,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:35:38,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:35:38,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:35:38,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:35:38,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:35:38,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:35:38,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:35:38,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:35:38,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:35:38,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:35:38,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:35:38,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-25 23:35:38,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:35:38,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:35:38,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:35:38,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:35:38,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:35:38,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:35:38,534 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:35:38,534 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:35:38,535 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:35:38,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:35:38,536 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:35:38,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:35:38,537 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:35:38,537 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:35:38,537 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:35:38,538 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:35:38,538 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:35:38,538 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:35:38,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:35:38,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:35:38,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:35:38,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:35:38,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:35:38,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:35:38,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:35:38,541 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:35:38,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:35:38,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:35:38,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:35:38,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:35:38,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:35:38,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:38,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:35:38,544 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:35:38,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:35:38,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:35:38,544 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:35:38,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:35:38,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:35:38,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:35:38,546 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_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/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_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af [2022-11-25 23:35:38,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:35:38,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:35:38,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:35:38,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:35:38,886 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:35:38,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2022-11-25 23:35:42,061 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:35:42,454 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:35:42,454 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2022-11-25 23:35:42,474 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/data/997399e8a/d315c9a7acb84c7393415813053609e7/FLAG1fd39fcc2 [2022-11-25 23:35:42,495 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/data/997399e8a/d315c9a7acb84c7393415813053609e7 [2022-11-25 23:35:42,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:35:42,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:35:42,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:42,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:35:42,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:35:42,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:42" (1/1) ... [2022-11-25 23:35:42,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294deea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:42, skipping insertion in model container [2022-11-25 23:35:42,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:35:42" (1/1) ... [2022-11-25 23:35:42,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:35:42,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:35:42,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:42,955 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:35:43,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:35:43,056 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:35:43,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43 WrapperNode [2022-11-25 23:35:43,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:35:43,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:43,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:35:43,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:35:43,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,108 INFO L138 Inliner]: procedures = 111, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-25 23:35:43,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:35:43,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:35:43,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:35:43,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:35:43,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,136 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:35:43,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:35:43,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:35:43,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:35:43,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (1/1) ... [2022-11-25 23:35:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:35:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:43,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:35:43,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:35:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:35:43,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:35:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:35:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:35:43,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:35:43,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:35:43,346 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:35:43,349 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:35:43,459 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:35:43,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:35:43,497 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:35:43,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:43 BoogieIcfgContainer [2022-11-25 23:35:43,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:35:43,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:35:43,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:35:43,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:35:43,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:35:42" (1/3) ... [2022-11-25 23:35:43,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd2a3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:43, skipping insertion in model container [2022-11-25 23:35:43,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:35:43" (2/3) ... [2022-11-25 23:35:43,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd2a3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:35:43, skipping insertion in model container [2022-11-25 23:35:43,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:43" (3/3) ... [2022-11-25 23:35:43,519 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3a-alloca.i [2022-11-25 23:35:43,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:35:43,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 23:35:43,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:35:43,638 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;@79c7950f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:35:43,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 23:35:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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-25 23:35:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:35:43,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:43,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:35:43,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2095557, now seen corresponding path program 1 times [2022-11-25 23:35:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:43,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963355052] [2022-11-25 23:35:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:43,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:43,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:43,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350765700] [2022-11-25 23:35:43,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:43,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:43,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:43,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:43,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:35:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:44,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:35:44,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:44,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-25 23:35:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:44,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:44,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963355052] [2022-11-25 23:35:44,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:44,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350765700] [2022-11-25 23:35:44,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350765700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:44,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:44,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366938023] [2022-11-25 23:35:44,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:44,568 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 23:35:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:44,668 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-11-25 23:35:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:44,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:35:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:44,679 INFO L225 Difference]: With dead ends: 15 [2022-11-25 23:35:44,679 INFO L226 Difference]: Without dead ends: 10 [2022-11-25 23:35:44,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:44,686 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:44,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:35:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-25 23:35:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-25 23:35:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-25 23:35:44,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2022-11-25 23:35:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:44,722 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-25 23:35:44,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-25 23:35:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-25 23:35:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:35:44,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:44,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:35:44,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:44,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:44,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 64962319, now seen corresponding path program 1 times [2022-11-25 23:35:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:44,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617591893] [2022-11-25 23:35:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:44,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:44,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345510309] [2022-11-25 23:35:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:44,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:44,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:44,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:35:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:45,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:35:45,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:45,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-25 23:35:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:45,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:45,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617591893] [2022-11-25 23:35:45,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:45,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345510309] [2022-11-25 23:35:45,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345510309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:45,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:45,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:35:45,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539041847] [2022-11-25 23:35:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:45,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:35:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:35:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:35:45,268 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:45,318 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-11-25 23:35:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:35:45,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:35:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:45,320 INFO L225 Difference]: With dead ends: 10 [2022-11-25 23:35:45,320 INFO L226 Difference]: Without dead ends: 9 [2022-11-25 23:35:45,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:35:45,324 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:45,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-25 23:35:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-25 23:35:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-25 23:35:45,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-25 23:35:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:45,333 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-25 23:35:45,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-25 23:35:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:35:45,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:45,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:35:45,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:45,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-25 23:35:45,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2013831943, now seen corresponding path program 1 times [2022-11-25 23:35:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:45,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285410807] [2022-11-25 23:35:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:45,575 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:45,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191341507] [2022-11-25 23:35:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:45,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:45,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:35:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:45,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 23:35:45,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:45,723 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 23:35:45,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 23:35:45,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:45,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:45,826 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 38 treesize of output 11 [2022-11-25 23:35:45,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:35:46,058 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:35:46,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 23:35:46,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-25 23:35:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:46,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:46,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285410807] [2022-11-25 23:35:46,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191341507] [2022-11-25 23:35:46,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191341507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:46,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:46,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863943261] [2022-11-25 23:35:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:35:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:35:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:35:46,085 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:46,173 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-11-25 23:35:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:35:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:35:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:46,175 INFO L225 Difference]: With dead ends: 17 [2022-11-25 23:35:46,175 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:35:46,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:35:46,177 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:35:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-11-25 23:35:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 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-25 23:35:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-25 23:35:46,182 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2022-11-25 23:35:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:46,182 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-25 23:35:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-25 23:35:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:35:46,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:46,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:35:46,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:46,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:46,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1995719151, now seen corresponding path program 1 times [2022-11-25 23:35:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:46,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054199788] [2022-11-25 23:35:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:46,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884055826] [2022-11-25 23:35:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:46,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:46,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:35:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:46,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 23:35:46,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:46,585 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 23:35:46,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 23:35:46,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:46,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-25 23:35:46,633 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 42 treesize of output 15 [2022-11-25 23:35:46,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 23:35:46,897 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:35:46,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 23:35:46,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-25 23:35:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:46,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:35:46,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:46,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054199788] [2022-11-25 23:35:46,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:46,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884055826] [2022-11-25 23:35:46,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884055826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:35:46,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:35:46,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:35:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022907423] [2022-11-25 23:35:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:35:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:35:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:35:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:35:46,944 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:47,043 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-25 23:35:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:35:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:35:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:47,045 INFO L225 Difference]: With dead ends: 16 [2022-11-25 23:35:47,045 INFO L226 Difference]: Without dead ends: 15 [2022-11-25 23:35:47,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:35:47,051 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 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-25 23:35:47,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:35:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-25 23:35:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-25 23:35:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 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-25 23:35:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 23:35:47,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2022-11-25 23:35:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:47,065 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 23:35:47,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 23:35:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:35:47,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:47,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2022-11-25 23:35:47,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:47,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:47,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1080263334, now seen corresponding path program 1 times [2022-11-25 23:35:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845641050] [2022-11-25 23:35:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:47,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:47,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885719983] [2022-11-25 23:35:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:47,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:47,295 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:47,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:35:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:47,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:35:47,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:47,443 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 23:35:47,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 23:35:47,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:47,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-25 23:35:47,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-11-25 23:35:47,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:35:47,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:35:47,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2022-11-25 23:35:47,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 23:35:47,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:35:47,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-25 23:35:47,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:35:47,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:47,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2022-11-25 23:35:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:47,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:47,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-25 23:35:48,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:35:48,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-25 23:35:48,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-11-25 23:35:48,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 23:35:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 23:35:48,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845641050] [2022-11-25 23:35:48,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885719983] [2022-11-25 23:35:48,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885719983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:48,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093565124] [2022-11-25 23:35:48,119 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:35:48,119 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:48,122 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:48,130 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:48,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:48,183 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:35:48,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:35:48,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:35:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:48,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 23:35:48,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:48,294 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 78 treesize of output 41 [2022-11-25 23:35:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:48,338 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 34 treesize of output 25 [2022-11-25 23:35:48,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:48,571 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:48,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-11-25 23:35:48,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:48,818 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:48,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-11-25 23:35:49,047 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-25 23:35:49,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:49,140 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:49,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:49,322 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-25 23:35:49,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:49,409 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:49,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:49,516 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:50,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '306#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_15| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_15| Int)) (and (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|) 2147483648)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|) 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|)))) (not (<= 0 (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem9#1|))) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:35:50,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:35:50,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:35:50,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-11-25 23:35:50,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982805924] [2022-11-25 23:35:50,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:35:50,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:35:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:35:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=4, NotChecked=34, Total=380 [2022-11-25 23:35:50,188 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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-25 23:35:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:50,334 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-11-25 23:35:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:35:50,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 23:35:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:50,338 INFO L225 Difference]: With dead ends: 15 [2022-11-25 23:35:50,338 INFO L226 Difference]: Without dead ends: 14 [2022-11-25 23:35:50,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=4, NotChecked=38, Total=462 [2022-11-25 23:35:50,339 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:50,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 1 Unknown, 7 Unchecked, 0.1s Time] [2022-11-25 23:35:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-25 23:35:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-25 23:35:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 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-25 23:35:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-25 23:35:50,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-11-25 23:35:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:50,344 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-25 23:35:50,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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-25 23:35:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-25 23:35:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:35:50,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:50,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2022-11-25 23:35:50,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:50,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:50,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash 871575070, now seen corresponding path program 1 times [2022-11-25 23:35:50,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:50,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409832580] [2022-11-25 23:35:50,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:50,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:50,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051127009] [2022-11-25 23:35:50,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:50,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:50,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:50,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:50,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:35:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:50,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 23:35:50,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:50,688 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 23:35:50,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 23:35:50,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:50,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-11-25 23:35:50,747 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 49 treesize of output 20 [2022-11-25 23:35:50,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 23:35:50,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:35:50,837 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 14 treesize of output 16 [2022-11-25 23:35:50,869 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 28 treesize of output 16 [2022-11-25 23:35:50,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:50,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:35:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:50,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:50,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-25 23:35:50,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int)) (v_ArrVal_188 Int)) (or (not (<= v_ArrVal_188 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_188)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-25 23:35:50,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int)) (v_ArrVal_188 Int) (v_ArrVal_187 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_187))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_188)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_188))))) is different from false [2022-11-25 23:35:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:35:50,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:50,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409832580] [2022-11-25 23:35:50,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:50,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051127009] [2022-11-25 23:35:50,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051127009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:50,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1487546750] [2022-11-25 23:35:50,997 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:35:50,997 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:50,997 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:50,997 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:50,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:51,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:51,027 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:35:51,027 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 1 case distinctions, treesize of input 27 treesize of output 19 [2022-11-25 23:35:51,048 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:35:51,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:35:51,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:35:51,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:51,135 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 82 treesize of output 45 [2022-11-25 23:35:51,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:51,200 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 85 treesize of output 72 [2022-11-25 23:35:51,334 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-25 23:35:51,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:51,397 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:51,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:51,532 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-25 23:35:51,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:51,595 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:51,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:51,680 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:52,232 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '433#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_20| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_20| Int)) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_20| |v_ULTIMATE.start_test_fun_#t~mem8#1_20|) 2147483647) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_20| |v_ULTIMATE.start_test_fun_#t~mem8#1_20|) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_20| |v_ULTIMATE.start_test_fun_#t~mem8#1_20|)))) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-11-25 23:35:52,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:35:52,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:35:52,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-11-25 23:35:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652491146] [2022-11-25 23:35:52,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:35:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:35:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:35:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=142, Unknown=5, NotChecked=78, Total=272 [2022-11-25 23:35:52,235 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 23:35:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:52,372 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-11-25 23:35:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:35:52,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 23:35:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:52,373 INFO L225 Difference]: With dead ends: 21 [2022-11-25 23:35:52,373 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 23:35:52,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=186, Unknown=7, NotChecked=90, Total=342 [2022-11-25 23:35:52,375 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:52,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 2 Unknown, 32 Unchecked, 0.0s Time] [2022-11-25 23:35:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 23:35:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-25 23:35:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 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-25 23:35:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-25 23:35:52,380 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2022-11-25 23:35:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:52,380 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-25 23:35:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 23:35:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-25 23:35:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:35:52,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:52,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1] [2022-11-25 23:35:52,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 23:35:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:35:52,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1060610155, now seen corresponding path program 2 times [2022-11-25 23:35:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881438558] [2022-11-25 23:35:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:52,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1050198825] [2022-11-25 23:35:52,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:35:52,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:52,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:52,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:35:52,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:35:52,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:35:52,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 23:35:52,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:52,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:35:52,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:52,761 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 14 treesize of output 14 [2022-11-25 23:35:52,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:52,801 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 14 treesize of output 16 [2022-11-25 23:35:52,827 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 28 treesize of output 16 [2022-11-25 23:35:52,853 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 14 treesize of output 16 [2022-11-25 23:35:52,885 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 28 treesize of output 16 [2022-11-25 23:35:52,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:52,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:35:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:52,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:52,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_245 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-25 23:35:52,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_ArrVal_245 (Array Int Int))) (or (not (<= v_ArrVal_244 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_244)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-25 23:35:52,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_ArrVal_242 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_242))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_244)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_244))))) is different from false [2022-11-25 23:35:53,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_242))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_244) (not (<= v_ArrVal_240 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_244)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-25 23:35:53,080 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (v_ArrVal_244 Int) (v_ArrVal_240 Int) (v_ArrVal_242 (Array Int Int)) (v_ArrVal_245 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_239))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_240)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_242))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_240) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_244) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_244)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-25 23:35:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-11-25 23:35:53,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881438558] [2022-11-25 23:35:53,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050198825] [2022-11-25 23:35:53,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050198825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432344534] [2022-11-25 23:35:53,133 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:35:53,133 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:53,134 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:53,134 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:53,134 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:53,164 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:35:53,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:35:53,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:35:53,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:53,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 23:35:53,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:53,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 78 treesize of output 41 [2022-11-25 23:35:53,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:53,282 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 34 treesize of output 25 [2022-11-25 23:35:53,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:53,461 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:53,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-11-25 23:35:53,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:53,619 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:53,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-11-25 23:35:53,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-25 23:35:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:53,896 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:53,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:54,053 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-25 23:35:54,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:54,123 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:54,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:54,217 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:54,723 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '614#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_27| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_27| Int)) (and (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_27| |v_ULTIMATE.start_test_fun_#t~mem8#1_27|) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_27| |v_ULTIMATE.start_test_fun_#t~mem8#1_27|)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_27| |v_ULTIMATE.start_test_fun_#t~mem8#1_27|) 2147483647))) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-11-25 23:35:54,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:35:54,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:35:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-11-25 23:35:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719166513] [2022-11-25 23:35:54,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:35:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:35:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:54,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:35:54,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=166, Unknown=5, NotChecked=150, Total=380 [2022-11-25 23:35:54,725 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:54,836 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-11-25 23:35:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:35:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:35:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:54,837 INFO L225 Difference]: With dead ends: 27 [2022-11-25 23:35:54,837 INFO L226 Difference]: Without dead ends: 26 [2022-11-25 23:35:54,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=189, Unknown=5, NotChecked=160, Total=420 [2022-11-25 23:35:54,838 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:54,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-11-25 23:35:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-25 23:35:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-25 23:35:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 23:35:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-25 23:35:54,847 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2022-11-25 23:35:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:54,848 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-25 23:35:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-25 23:35:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:35:54,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:54,852 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1] [2022-11-25 23:35:54,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:35:55,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:35:55,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash 924738808, now seen corresponding path program 3 times [2022-11-25 23:35:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:55,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23736708] [2022-11-25 23:35:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:55,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:55,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829847813] [2022-11-25 23:35:55,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:35:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:55,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:55,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:35:55,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:35:55,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:35:55,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 23:35:55,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:55,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:35:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:55,194 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 14 treesize of output 14 [2022-11-25 23:35:55,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:55,222 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 14 treesize of output 16 [2022-11-25 23:35:55,274 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 28 treesize of output 16 [2022-11-25 23:35:55,301 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 14 treesize of output 16 [2022-11-25 23:35:55,332 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 28 treesize of output 16 [2022-11-25 23:35:55,369 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 14 treesize of output 16 [2022-11-25 23:35:55,399 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 28 treesize of output 16 [2022-11-25 23:35:55,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:55,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:35:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:55,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:55,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_311 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_310 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))) is different from false [2022-11-25 23:35:55,521 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_310))))) is different from false [2022-11-25 23:35:55,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_306)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_306 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_310) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-25 23:35:55,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_310 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_306)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_310) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_306) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-25 23:35:55,675 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_310 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_306)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_310) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_306) (not (<= v_ArrVal_303 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-25 23:35:55,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_310 Int) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_306 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_302))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_306)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_306) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_310) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_303))))))))) is different from false [2022-11-25 23:35:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-11-25 23:35:55,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:55,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23736708] [2022-11-25 23:35:55,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:55,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829847813] [2022-11-25 23:35:55,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829847813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:55,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258926150] [2022-11-25 23:35:55,809 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:35:55,810 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:55,810 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:55,810 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:55,810 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:55,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:55,843 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:35:55,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 1 case distinctions, treesize of input 27 treesize of output 19 [2022-11-25 23:35:55,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:55,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:35:55,888 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:35:55,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:35:55,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:55,968 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 82 treesize of output 45 [2022-11-25 23:35:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:56,029 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 85 treesize of output 72 [2022-11-25 23:35:56,179 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-25 23:35:56,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:56,256 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:56,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:56,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-25 23:35:56,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:56,492 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:56,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:56,575 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:35:57,095 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '850#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_34| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_34| Int)) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_34| |v_ULTIMATE.start_test_fun_#t~mem8#1_34|) 2147483647) (= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_34| |v_ULTIMATE.start_test_fun_#t~mem8#1_34|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_34| |v_ULTIMATE.start_test_fun_#t~mem8#1_34|) 2147483648)))) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-11-25 23:35:57,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:35:57,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:35:57,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-11-25 23:35:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095090302] [2022-11-25 23:35:57,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:35:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:35:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:35:57,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:35:57,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=237, Unknown=8, NotChecked=222, Total=552 [2022-11-25 23:35:57,098 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 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-25 23:35:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:35:57,247 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-11-25 23:35:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:35:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:35:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:35:57,248 INFO L225 Difference]: With dead ends: 39 [2022-11-25 23:35:57,248 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 23:35:57,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=264, Unknown=8, NotChecked=234, Total=600 [2022-11-25 23:35:57,250 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:35:57,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 1 Unknown, 98 Unchecked, 0.1s Time] [2022-11-25 23:35:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 23:35:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 23:35:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:35:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-11-25 23:35:57,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 25 [2022-11-25 23:35:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:35:57,256 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-11-25 23:35:57,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 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-25 23:35:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-11-25 23:35:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:35:57,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:35:57,257 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1] [2022-11-25 23:35:57,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-25 23:35:57,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 23:35:57,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:35:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:35:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1866717998, now seen corresponding path program 4 times [2022-11-25 23:35:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:35:57,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386294900] [2022-11-25 23:35:57,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:35:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:35:57,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:35:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885822148] [2022-11-25 23:35:57,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:35:57,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:35:57,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:35:57,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:35:57,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:35:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:35:57,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 23:35:57,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:35:57,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:35:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:57,640 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 14 treesize of output 14 [2022-11-25 23:35:57,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-25 23:35:57,668 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 14 treesize of output 16 [2022-11-25 23:35:57,697 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 28 treesize of output 16 [2022-11-25 23:35:57,753 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 14 treesize of output 16 [2022-11-25 23:35:57,786 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 28 treesize of output 16 [2022-11-25 23:35:57,818 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 14 treesize of output 16 [2022-11-25 23:35:57,848 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 28 treesize of output 16 [2022-11-25 23:35:57,886 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 14 treesize of output 16 [2022-11-25 23:35:57,918 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 28 treesize of output 16 [2022-11-25 23:35:57,950 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 14 treesize of output 16 [2022-11-25 23:35:57,991 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 28 treesize of output 16 [2022-11-25 23:35:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:58,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:35:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:35:58,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:35:58,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_399 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-25 23:35:58,101 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_399 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_397 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))) is different from false [2022-11-25 23:35:58,124 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397))))) is different from false [2022-11-25 23:35:58,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_395 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397))))) is different from false [2022-11-25 23:35:58,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395))))))) is different from false [2022-11-25 23:35:58,278 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_391 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397))))))) is different from false [2022-11-25 23:35:58,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_390))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_391))))))))) is different from false [2022-11-25 23:35:58,433 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_397 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_388)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_390))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_391) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (not (<= v_ArrVal_388 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395))))))))) is different from false [2022-11-25 23:35:58,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_397 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_387))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_388)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_390))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_388) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_391))))))))))) is different from false [2022-11-25 23:35:58,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_386 Int) (v_ArrVal_397 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_386)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_387))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_388)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_390))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_395) (not (<= v_ArrVal_386 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_391) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_388))))))))))) is different from false [2022-11-25 23:35:58,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_386 Int) (v_ArrVal_397 Int) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 Int) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_391 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_387 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_384))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_386)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_387))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_388)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_390))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_397)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_397) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_391) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_395) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_386) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_388))))))))))))) is different from false [2022-11-25 23:35:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 90 not checked. [2022-11-25 23:35:58,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:35:58,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386294900] [2022-11-25 23:35:58,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:35:58,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885822148] [2022-11-25 23:35:58,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885822148] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:35:58,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038484819] [2022-11-25 23:35:58,931 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:35:58,931 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:35:58,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:35:58,932 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:35:58,932 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:35:58,967 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:35:58,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:35:58,990 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:35:58,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:35:59,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:59,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 23:35:59,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:59,066 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 78 treesize of output 41 [2022-11-25 23:35:59,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:35:59,099 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 34 treesize of output 25 [2022-11-25 23:35:59,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:59,245 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:59,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-11-25 23:35:59,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:59,396 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:35:59,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-11-25 23:35:59,597 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-25 23:35:59,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:59,659 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:59,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:59,791 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-25 23:35:59,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:35:59,856 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:35:59,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:35:59,932 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:00,444 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1195#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_44| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_44| Int)) (and (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) 2147483647))) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-11-25 23:36:00,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:00,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:00,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2022-11-25 23:36:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102252583] [2022-11-25 23:36:00,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:00,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:36:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:36:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=328, Unknown=11, NotChecked=528, Total=992 [2022-11-25 23:36:00,447 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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-25 23:36:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:00,725 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-11-25 23:36:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:36:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 23:36:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:00,727 INFO L225 Difference]: With dead ends: 45 [2022-11-25 23:36:00,727 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:36:00,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 79 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=360, Unknown=11, NotChecked=550, Total=1056 [2022-11-25 23:36:00,728 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:00,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 187 Unchecked, 0.1s Time] [2022-11-25 23:36:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:36:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 23:36:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:36:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-11-25 23:36:00,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 37 [2022-11-25 23:36:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:00,736 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-11-25 23:36:00,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 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-25 23:36:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-11-25 23:36:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:36:00,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:00,738 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1] [2022-11-25 23:36:00,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:00,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:00,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:36:00,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1423032351, now seen corresponding path program 5 times [2022-11-25 23:36:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:00,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980068771] [2022-11-25 23:36:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:00,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 23:36:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386815105] [2022-11-25 23:36:00,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:36:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:00,972 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:00,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:36:01,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-25 23:36:01,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:36:01,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:36:01,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:01,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 23:36:01,380 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 40 treesize of output 20 [2022-11-25 23:36:01,441 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 16 treesize of output 18 [2022-11-25 23:36:01,646 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 44 treesize of output 24 [2022-11-25 23:36:01,733 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 16 treesize of output 18 [2022-11-25 23:36:04,087 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 42 treesize of output 22 [2022-11-25 23:36:04,451 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 16 treesize of output 18 [2022-11-25 23:36:06,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-11-25 23:36:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 23:36:06,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:06,830 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 Int) (v_ArrVal_484 (Array Int Int))) (or (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_483)) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_483)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)))) is different from false [2022-11-25 23:36:07,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_49| Int) (v_ArrVal_484 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_481))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem7#1_49|)) (< .cse0 2) (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_49| |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_483)) (not (< .cse0 100)) (not (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_483)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100))))))) is different from false [2022-11-25 23:36:07,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_49| Int) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_479)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_481))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (< .cse0 100)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_49| |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_483)) (not (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_483)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (< .cse0 2) (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_479)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem7#1_49|))))))) is different from false [2022-11-25 23:36:08,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_50| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_49| Int) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_478))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_479)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_481))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem7#1_49|)) (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_49| |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_483)) (< .cse1 2) (not (<= .cse1 |v_ULTIMATE.start_test_fun_#t~mem7#1_50|)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (not (<= (* .cse1 |v_ULTIMATE.start_test_fun_#t~mem7#1_50|) v_ArrVal_479)) (not (< .cse0 100)) (< .cse0 2) (not (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_483)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (< .cse1 100))))))))) is different from false [2022-11-25 23:36:09,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_50| Int) (v_ArrVal_476 Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_483 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_49| Int) (v_ArrVal_484 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_479 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_476)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_478))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_479)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_481))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_483)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (< .cse2 100)) (< .cse3 2) (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_49| |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_483)) (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_50| .cse2) v_ArrVal_479)) (not (<= .cse3 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (not (< .cse3 100)) (< .cse2 2) (not (<= .cse2 |v_ULTIMATE.start_test_fun_#t~mem7#1_50|)) (not (<= .cse3 |v_ULTIMATE.start_test_fun_#t~mem7#1_49|)) (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_476))))))))) is different from false [2022-11-25 23:36:10,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:10,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 357 treesize of output 221 [2022-11-25 23:36:10,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 393 [2022-11-25 23:36:10,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-25 23:36:10,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 180 [2022-11-25 23:36:10,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-11-25 23:36:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 35 proven. 24 refuted. 4 times theorem prover too weak. 21 trivial. 42 not checked. [2022-11-25 23:36:10,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980068771] [2022-11-25 23:36:10,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 23:36:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386815105] [2022-11-25 23:36:10,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386815105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [718792606] [2022-11-25 23:36:10,539 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:36:10,539 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:10,539 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:10,539 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:10,540 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:10,565 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 23:36:10,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 23:36:10,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-25 23:36:10,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:10,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-25 23:36:10,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:10,646 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 78 treesize of output 41 [2022-11-25 23:36:10,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:10,673 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 34 treesize of output 25 [2022-11-25 23:36:10,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:10,836 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:36:10,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-11-25 23:36:10,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:10,989 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-11-25 23:36:10,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-11-25 23:36:11,181 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-25 23:36:11,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:11,258 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:36:11,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:36:11,385 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-25 23:36:11,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:11,447 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-25 23:36:11,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-11-25 23:36:11,521 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:12,820 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1595#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_58| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_58| Int)) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_58| |v_ULTIMATE.start_test_fun_#t~mem8#1_58|) 2147483647) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_58| |v_ULTIMATE.start_test_fun_#t~mem8#1_58|) 2147483648)) (= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_58| |v_ULTIMATE.start_test_fun_#t~mem8#1_58|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-11-25 23:36:12,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:12,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-11-25 23:36:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205072331] [2022-11-25 23:36:12,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:12,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:36:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:36:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=556, Unknown=26, NotChecked=270, Total=992 [2022-11-25 23:36:12,823 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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-25 23:36:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:15,373 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-11-25 23:36:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:36:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-25 23:36:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:15,374 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:36:15,374 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:36:15,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=220, Invalid=765, Unknown=27, NotChecked=320, Total=1332 [2022-11-25 23:36:15,376 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:15,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 68 Unchecked, 1.3s Time] [2022-11-25 23:36:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:36:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:36:15,377 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-25 23:36:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:36:15,377 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-11-25 23:36:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:15,377 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:36:15,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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-25 23:36:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:36:15,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:36:15,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 23:36:15,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 23:36:15,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 23:36:15,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 23:36:15,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:36:15,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:36:20,887 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 81 DAG size of output: 69 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 23:36:20,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-11-25 23:36:20,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:36:20,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2022-11-25 23:36:20,891 INFO L899 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-11-25 23:36:20,891 INFO L899 garLoopResultBuilder]: For program point L554-1(line 554) no Hoare annotation was computed. [2022-11-25 23:36:20,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-11-25 23:36:20,892 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2022-11-25 23:36:20,892 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:36:20,892 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-11-25 23:36:20,892 INFO L899 garLoopResultBuilder]: For program point L555-1(line 555) no Hoare annotation was computed. [2022-11-25 23:36:20,892 INFO L899 garLoopResultBuilder]: For program point L553-3(lines 553 556) no Hoare annotation was computed. [2022-11-25 23:36:20,893 INFO L895 garLoopResultBuilder]: At program point L553-5(lines 553 556) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (<= 0 (+ .cse0 2147483648))) (.cse3 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0)) (.cse4 (select .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (and (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= .cse0 (select v_DerPreprocessor_6 |ULTIMATE.start_test_fun_~c~0#1.offset|)) (= (select (store (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse1))) .cse2 .cse3 (= .cse0 0)) (and (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_45| Int) (v_arrayElimCell_135 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_46| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_45| Int)) (and (<= v_arrayElimCell_135 |v_ULTIMATE.start_test_fun_#t~mem7#1_46|) (< v_arrayElimCell_135 100) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_45|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_45| |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) v_arrayElimCell_135) (<= (* v_arrayElimCell_135 |v_ULTIMATE.start_test_fun_#t~mem7#1_46|) .cse4))) .cse2 .cse5 .cse3 (<= .cse0 2)) (and (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_47| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_45| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_47| Int) (v_arrayElimCell_135 Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_46| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_45| Int)) (let ((.cse6 (* v_arrayElimCell_135 |v_ULTIMATE.start_test_fun_#t~mem7#1_46|))) (and (<= v_arrayElimCell_135 |v_ULTIMATE.start_test_fun_#t~mem7#1_46|) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) (<= .cse6 99) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_47| |v_ULTIMATE.start_test_fun_#t~mem8#1_47|) .cse4) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_45|) (<= .cse6 |v_ULTIMATE.start_test_fun_#t~mem7#1_47|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_45| |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) v_arrayElimCell_135) (<= .cse6 |v_ULTIMATE.start_test_fun_#t~mem8#1_47|)))) .cse2 .cse5 .cse3 (<= .cse0 3)) (and (<= .cse0 1) .cse2 .cse5 .cse3 (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_45| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_45| Int)) (and (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_45| |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) .cse4) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_45|))))))) [2022-11-25 23:36:20,893 INFO L902 garLoopResultBuilder]: At program point L553-6(lines 553 556) the Hoare annotation is: true [2022-11-25 23:36:20,896 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2022-11-25 23:36:20,899 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:36:20,909 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:20,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,910 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:20,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,911 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,912 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,913 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:20,914 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,915 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,916 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:20,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,917 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,924 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:20,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:20,925 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,926 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,927 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,928 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:20,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:20,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,929 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:20,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,930 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:20,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:20,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:20,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,931 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:20,932 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:20,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:36:20 BoogieIcfgContainer [2022-11-25 23:36:20,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:36:20,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:36:20,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:36:20,935 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:36:20,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:35:43" (3/4) ... [2022-11-25 23:36:20,947 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:36:20,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 23:36:20,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 23:36:20,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 23:36:20,958 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:36:20,987 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((x_ref == 0 && (\exists v_DerPreprocessor_5 : [int]int, v_DerPreprocessor_6 : [int]int :: unknown-#memory_int-unknown[c][c] == v_DerPreprocessor_6[c] && unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_5][c := v_DerPreprocessor_6][x_ref := v_DerPreprocessor_5][c := v_DerPreprocessor_6][x_ref] == unknown-#memory_int-unknown[x_ref])) && !(x_ref == c)) && c == 0) && unknown-#memory_int-unknown[c][c] == 0) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_arrayElimCell_135 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: ((((v_arrayElimCell_135 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46 && v_arrayElimCell_135 < 100) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45) && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_arrayElimCell_135) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= unknown-#memory_int-unknown[x_ref][x_ref]) && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && unknown-#memory_int-unknown[c][c] <= 2)) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem8#1_47 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_47 : int, v_arrayElimCell_135 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: ((((((v_arrayElimCell_135 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46 && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= 99) && v_ULTIMATE.start_test_fun_#t~mem7#1_47 * v_ULTIMATE.start_test_fun_#t~mem8#1_47 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= v_ULTIMATE.start_test_fun_#t~mem7#1_47) && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_arrayElimCell_135) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= v_ULTIMATE.start_test_fun_#t~mem8#1_47) && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && unknown-#memory_int-unknown[c][c] <= 3)) || ((((unknown-#memory_int-unknown[c][c] <= 1 && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && (\exists v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: (2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45 && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45)) [2022-11-25 23:36:21,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:36:21,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:36:21,001 INFO L158 Benchmark]: Toolchain (without parser) took 38497.80ms. Allocated memory was 199.2MB in the beginning and 427.8MB in the end (delta: 228.6MB). Free memory was 165.3MB in the beginning and 159.3MB in the end (delta: 6.1MB). Peak memory consumption was 235.6MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,002 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 142.6MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:36:21,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.69ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 149.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.02ms. Allocated memory is still 199.2MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,003 INFO L158 Benchmark]: Boogie Preprocessor took 29.88ms. Allocated memory is still 199.2MB. Free memory was 147.5MB in the beginning and 146.8MB in the end (delta: 742.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,003 INFO L158 Benchmark]: RCFGBuilder took 360.14ms. Allocated memory is still 199.2MB. Free memory was 146.8MB in the beginning and 133.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,004 INFO L158 Benchmark]: TraceAbstraction took 37431.96ms. Allocated memory was 199.2MB in the beginning and 427.8MB in the end (delta: 228.6MB). Free memory was 132.8MB in the beginning and 162.4MB in the end (delta: -29.6MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,005 INFO L158 Benchmark]: Witness Printer took 65.93ms. Allocated memory is still 427.8MB. Free memory was 162.4MB in the beginning and 159.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:36:21,014 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.32ms. Allocated memory is still 142.6MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.69ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 149.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.02ms. Allocated memory is still 199.2MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.88ms. Allocated memory is still 199.2MB. Free memory was 147.5MB in the beginning and 146.8MB in the end (delta: 742.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.14ms. Allocated memory is still 199.2MB. Free memory was 146.8MB in the beginning and 133.5MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37431.96ms. Allocated memory was 199.2MB in the beginning and 427.8MB in the end (delta: 228.6MB). Free memory was 132.8MB in the beginning and 162.4MB in the end (delta: -29.6MB). Peak memory consumption was 202.1MB. Max. memory is 16.1GB. * Witness Printer took 65.93ms. Allocated memory is still 427.8MB. Free memory was 162.4MB in the beginning and 159.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,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: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 475 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 25 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 308 SyntacticMatches, 27 SemanticMatches, 165 ConstructedPredicates, 31 IntricatePredicates, 4 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=9, InterpolantAutomatonStates: 82, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 207 HoareAnnotationTreeSize, 2 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 304 ConstructedInterpolants, 120 QuantifiedInterpolants, 16845 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1109 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 171/562 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 4 specifications checked. All of them hold - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 553]: Loop Invariant [2022-11-25 23:36:21,039 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,040 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:21,040 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,040 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:21,040 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,041 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,042 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,044 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,044 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,044 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,045 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,045 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:21,045 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:21,045 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,046 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,046 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,047 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:21,048 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,050 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,051 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,052 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:21,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_5,QUANTIFIED] [2022-11-25 23:36:21,056 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_6,QUANTIFIED] [2022-11-25 23:36:21,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,057 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,058 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,059 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:21,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:21,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,060 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_47,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_135,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-11-25 23:36:21,061 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_47,QUANTIFIED] [2022-11-25 23:36:21,064 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] [2022-11-25 23:36:21,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-11-25 23:36:21,066 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_45,QUANTIFIED] Derived loop invariant: ((((((x_ref == 0 && (\exists v_DerPreprocessor_5 : [int]int, v_DerPreprocessor_6 : [int]int :: unknown-#memory_int-unknown[c][c] == v_DerPreprocessor_6[c] && unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_5][c := v_DerPreprocessor_6][x_ref := v_DerPreprocessor_5][c := v_DerPreprocessor_6][x_ref] == unknown-#memory_int-unknown[x_ref])) && !(x_ref == c)) && c == 0) && unknown-#memory_int-unknown[c][c] == 0) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_arrayElimCell_135 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: ((((v_arrayElimCell_135 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46 && v_arrayElimCell_135 < 100) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45) && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_arrayElimCell_135) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= unknown-#memory_int-unknown[x_ref][x_ref]) && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && unknown-#memory_int-unknown[c][c] <= 2)) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem8#1_47 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_47 : int, v_arrayElimCell_135 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: ((((((v_arrayElimCell_135 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46 && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= 99) && v_ULTIMATE.start_test_fun_#t~mem7#1_47 * v_ULTIMATE.start_test_fun_#t~mem8#1_47 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= v_ULTIMATE.start_test_fun_#t~mem7#1_47) && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_arrayElimCell_135) && v_arrayElimCell_135 * v_ULTIMATE.start_test_fun_#t~mem7#1_46 <= v_ULTIMATE.start_test_fun_#t~mem8#1_47) && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && unknown-#memory_int-unknown[c][c] <= 3)) || ((((unknown-#memory_int-unknown[c][c] <= 1 && !(x_ref == c)) && 0 <= unknown-#memory_int-unknown[c][c] + 2147483648) && c == 0) && (\exists v_ULTIMATE.start_test_fun_#t~mem7#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int :: (2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45 && v_ULTIMATE.start_test_fun_#t~mem7#1_45 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_45)) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:36:21,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40d72b1f-b006-4d2e-8cb2-5f2c18200193/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE