./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-cav19/array_init_nondet_vars.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-cav19/array_init_nondet_vars.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:44:18,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:44:18,607 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:44:18,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:44:18,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:44:18,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:44:18,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:44:18,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:44:18,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:44:18,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:44:18,662 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:44:18,663 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:44:18,664 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:44:18,666 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:44:18,666 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:44:18,667 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:44:18,667 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:44:18,668 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:44:18,668 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:44:18,669 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:44:18,671 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:44:18,672 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:44:18,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:44:18,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:44:18,674 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:44:18,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:44:18,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:44:18,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:44:18,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:44:18,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:44:18,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:44:18,678 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:44:18,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:44:18,679 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:44:18,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:44:18,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:44:18,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:44:18,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:44:18,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:44:18,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:44:18,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:44:18,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:44:18,683 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:44:18,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:44:18,684 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:44:18,684 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:44:18,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:44:18,685 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/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_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f [2023-11-12 00:44:18,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:44:19,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:44:19,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:44:19,017 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:44:19,017 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:44:19,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2023-11-12 00:44:22,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:44:22,584 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:44:22,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2023-11-12 00:44:22,592 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/data/0e52e691f/03ce98b040d84324a4922b2c931a0768/FLAG786406305 [2023-11-12 00:44:22,607 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/data/0e52e691f/03ce98b040d84324a4922b2c931a0768 [2023-11-12 00:44:22,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:44:22,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:44:22,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:44:22,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:44:22,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:44:22,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2f8b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22, skipping insertion in model container [2023-11-12 00:44:22,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,644 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:44:22,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:44:22,853 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:44:22,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:44:22,887 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:44:22,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22 WrapperNode [2023-11-12 00:44:22,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:44:22,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:44:22,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:44:22,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:44:22,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,928 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-11-12 00:44:22,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:44:22,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:44:22,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:44:22,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:44:22,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:44:22,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:44:22,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:44:22,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:44:22,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (1/1) ... [2023-11-12 00:44:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:44:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:23,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:44:23,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:44:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:44:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 00:44:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 00:44:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:44:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:44:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:44:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:44:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:44:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:44:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:44:23,138 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:44:23,141 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:44:23,392 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:44:23,467 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:44:23,467 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:44:23,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:44:23 BoogieIcfgContainer [2023-11-12 00:44:23,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:44:23,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:44:23,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:44:23,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:44:23,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:44:22" (1/3) ... [2023-11-12 00:44:23,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8439c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:44:23, skipping insertion in model container [2023-11-12 00:44:23,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:44:22" (2/3) ... [2023-11-12 00:44:23,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8439c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:44:23, skipping insertion in model container [2023-11-12 00:44:23,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:44:23" (3/3) ... [2023-11-12 00:44:23,486 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_nondet_vars.c [2023-11-12 00:44:23,507 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:44:23,507 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-12 00:44:23,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:44:23,584 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=LoopHeads, 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;@f4fc07e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:44:23,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-12 00:44:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.75) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:44:23,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:23,605 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:23,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:23,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1001532643, now seen corresponding path program 1 times [2023-11-12 00:44:23,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814432653] [2023-11-12 00:44:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:44:23,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814432653] [2023-11-12 00:44:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814432653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:44:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:44:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469297138] [2023-11-12 00:44:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:23,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:44:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:44:24,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:44:24,027 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.75) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:24,131 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-12 00:44:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:44:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2023-11-12 00:44:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:24,141 INFO L225 Difference]: With dead ends: 54 [2023-11-12 00:44:24,141 INFO L226 Difference]: Without dead ends: 51 [2023-11-12 00:44:24,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:44:24,148 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:24,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-12 00:44:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2023-11-12 00:44:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-12 00:44:24,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2023-11-12 00:44:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:24,192 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-12 00:44:24,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-12 00:44:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:44:24,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:24,194 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:24,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:44:24,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:24,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 326663449, now seen corresponding path program 1 times [2023-11-12 00:44:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740960189] [2023-11-12 00:44:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:44:24,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740960189] [2023-11-12 00:44:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740960189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:44:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:44:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399595140] [2023-11-12 00:44:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:24,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:44:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:24,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:44:24,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:44:24,397 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:44:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:24,505 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-11-12 00:44:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:44:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 14 [2023-11-12 00:44:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:24,507 INFO L225 Difference]: With dead ends: 51 [2023-11-12 00:44:24,507 INFO L226 Difference]: Without dead ends: 50 [2023-11-12 00:44:24,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:44:24,510 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:24,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-12 00:44:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2023-11-12 00:44:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-12 00:44:24,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 14 [2023-11-12 00:44:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:24,521 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-12 00:44:24,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:44:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-12 00:44:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:44:24,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:24,522 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:24,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:44:24,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:24,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1536632376, now seen corresponding path program 1 times [2023-11-12 00:44:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022370672] [2023-11-12 00:44:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:44:24,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022370672] [2023-11-12 00:44:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022370672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:24,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678594189] [2023-11-12 00:44:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:24,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:24,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:44:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:24,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:44:24,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:44:24,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:44:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:44:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678594189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:44:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246050688] [2023-11-12 00:44:24,974 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:44:24,974 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:44:24,978 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:44:24,984 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:44:24,985 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:44:25,895 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 3 for LOIs [2023-11-12 00:44:25,898 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:44:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1246050688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:26,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:44:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 17 [2023-11-12 00:44:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535324779] [2023-11-12 00:44:26,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:44:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:44:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:44:26,671 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 11 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:27,048 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-11-12 00:44:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:44:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2023-11-12 00:44:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:27,050 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:44:27,050 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 00:44:27,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:44:27,052 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 73 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:27,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 43 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:44:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 00:44:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2023-11-12 00:44:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-11-12 00:44:27,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 15 [2023-11-12 00:44:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:27,068 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-11-12 00:44:27,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-11-12 00:44:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:44:27,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:27,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:27,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:27,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-12 00:44:27,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:27,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:27,277 INFO L85 PathProgramCache]: Analyzing trace with hash 400199739, now seen corresponding path program 1 times [2023-11-12 00:44:27,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495886646] [2023-11-12 00:44:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:44:27,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:27,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495886646] [2023-11-12 00:44:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495886646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:27,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:44:27,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:44:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032219414] [2023-11-12 00:44:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:27,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:44:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:27,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:44:27,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:44:27,347 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:27,414 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-12 00:44:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:44:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-11-12 00:44:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:27,416 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:44:27,417 INFO L226 Difference]: Without dead ends: 45 [2023-11-12 00:44:27,417 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 [2023-11-12 00:44:27,419 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:27,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:44:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-12 00:44:27,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-11-12 00:44:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-12 00:44:27,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 14 [2023-11-12 00:44:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:27,435 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-12 00:44:27,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-12 00:44:27,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:44:27,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:27,437 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:27,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:44:27,437 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:27,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2053725343, now seen corresponding path program 1 times [2023-11-12 00:44:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:27,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607710016] [2023-11-12 00:44:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:44:27,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:27,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607710016] [2023-11-12 00:44:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607710016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:27,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:44:27,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:44:27,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091336310] [2023-11-12 00:44:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:27,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:44:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:27,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:44:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:44:27,559 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:44:27,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:27,641 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-11-12 00:44:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:44:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2023-11-12 00:44:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:27,644 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:44:27,644 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:44:27,645 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 [2023-11-12 00:44:27,647 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:27,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:27,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:44:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-12 00:44:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-12 00:44:27,675 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2023-11-12 00:44:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:27,676 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-12 00:44:27,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:44:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-12 00:44:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:44:27,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:27,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:27,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:44:27,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:27,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash -478698461, now seen corresponding path program 1 times [2023-11-12 00:44:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10460567] [2023-11-12 00:44:27,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:44:27,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10460567] [2023-11-12 00:44:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10460567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816046734] [2023-11-12 00:44:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:27,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:27,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:44:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:27,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:44:27,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:44:27,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:44:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816046734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:27,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:44:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-11-12 00:44:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040682891] [2023-11-12 00:44:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:27,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:44:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:44:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:44:27,877 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:27,968 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-11-12 00:44:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:44:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-12 00:44:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:27,971 INFO L225 Difference]: With dead ends: 57 [2023-11-12 00:44:27,972 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:44:27,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:44:27,973 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:27,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:44:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-12 00:44:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 37 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-12 00:44:27,989 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 17 [2023-11-12 00:44:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:27,989 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-12 00:44:27,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-12 00:44:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-12 00:44:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:44:27,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:27,991 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:27,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:44:28,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:28,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1195500889, now seen corresponding path program 1 times [2023-11-12 00:44:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467820871] [2023-11-12 00:44:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:44:28,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467820871] [2023-11-12 00:44:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467820871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580801399] [2023-11-12 00:44:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:28,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:28,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:44:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:28,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:44:28,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:44:28,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:44:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580801399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:28,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:44:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-12 00:44:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464701642] [2023-11-12 00:44:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:44:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:44:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:44:28,474 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:44:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:28,577 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-12 00:44:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:44:28,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2023-11-12 00:44:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:28,580 INFO L225 Difference]: With dead ends: 43 [2023-11-12 00:44:28,581 INFO L226 Difference]: Without dead ends: 41 [2023-11-12 00:44:28,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:44:28,582 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:28,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 41 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-12 00:44:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-12 00:44:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 35 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:44:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-12 00:44:28,595 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2023-11-12 00:44:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:28,596 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-12 00:44:28,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:44:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-12 00:44:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:44:28,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:28,597 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:28,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-12 00:44:28,804 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:28,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1594178056, now seen corresponding path program 1 times [2023-11-12 00:44:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051266111] [2023-11-12 00:44:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:28,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051266111] [2023-11-12 00:44:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051266111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372838347] [2023-11-12 00:44:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:28,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:28,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:28,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:29,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:44:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:29,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 00:44:29,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:29,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:44:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372838347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:44:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360929658] [2023-11-12 00:44:29,237 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:44:29,237 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:44:29,238 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:44:29,238 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:44:29,238 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:44:31,268 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 3 for LOIs [2023-11-12 00:44:31,270 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:44:32,130 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1201#(and (<= |ULTIMATE.start_main_~n~0#1| 99999) (<= 2147483648 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~k~0#1| 9999) (<= |ULTIMATE.start_main_~j~0#1| 9999) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~n~0#1|))' at error location [2023-11-12 00:44:32,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:44:32,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:44:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-12 00:44:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326335715] [2023-11-12 00:44:32,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:44:32,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:44:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:44:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2023-11-12 00:44:32,133 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-12 00:44:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:32,341 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-11-12 00:44:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:44:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2023-11-12 00:44:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:32,343 INFO L225 Difference]: With dead ends: 57 [2023-11-12 00:44:32,344 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 00:44:32,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2023-11-12 00:44:32,348 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:32,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 51 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:44:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 00:44:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-11-12 00:44:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 45 states have internal predecessors, (51), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:44:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-11-12 00:44:32,368 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 25 [2023-11-12 00:44:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:32,370 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-11-12 00:44:32,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-12 00:44:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-11-12 00:44:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-12 00:44:32,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:32,372 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:32,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:32,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-12 00:44:32,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:32,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2120087867, now seen corresponding path program 1 times [2023-11-12 00:44:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127771924] [2023-11-12 00:44:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:32,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127771924] [2023-11-12 00:44:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127771924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971862341] [2023-11-12 00:44:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:32,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:32,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:32,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:32,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:44:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:32,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 00:44:32,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:33,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:44:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:44:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971862341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:44:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12101403] [2023-11-12 00:44:33,189 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:44:33,189 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:44:33,190 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:44:33,190 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:44:33,190 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:44:34,795 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 3 for LOIs [2023-11-12 00:44:34,796 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:44:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [12101403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:44:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7, 7, 7] total 28 [2023-11-12 00:44:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425565492] [2023-11-12 00:44:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:44:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:44:35,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2023-11-12 00:44:35,673 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:36,409 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-11-12 00:44:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:44:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2023-11-12 00:44:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:36,410 INFO L225 Difference]: With dead ends: 53 [2023-11-12 00:44:36,410 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 00:44:36,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2023-11-12 00:44:36,414 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:36,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:44:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 00:44:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2023-11-12 00:44:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-12 00:44:36,430 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2023-11-12 00:44:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:36,430 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-12 00:44:36,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-12 00:44:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:44:36,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:36,434 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:36,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:36,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 00:44:36,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:36,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:36,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1584550883, now seen corresponding path program 1 times [2023-11-12 00:44:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026187855] [2023-11-12 00:44:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:44:36,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026187855] [2023-11-12 00:44:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026187855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534630544] [2023-11-12 00:44:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:36,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:36,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:44:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:36,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:44:36,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:44:36,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:44:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534630544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:36,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:44:36,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-12 00:44:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606828261] [2023-11-12 00:44:36,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:44:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:44:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:44:36,841 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:44:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:36,911 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-11-12 00:44:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:44:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-11-12 00:44:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:36,912 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:44:36,912 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:44:36,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:44:36,913 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:36,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:44:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:44:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-11-12 00:44:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-11-12 00:44:36,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 27 [2023-11-12 00:44:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:36,931 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-11-12 00:44:36,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:44:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-11-12 00:44:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-12 00:44:36,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:36,937 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:36,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:44:37,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:37,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1876437192, now seen corresponding path program 1 times [2023-11-12 00:44:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091353836] [2023-11-12 00:44:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:44:37,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091353836] [2023-11-12 00:44:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091353836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:44:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219917032] [2023-11-12 00:44:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:37,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:44:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:44:37,242 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:44:37,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:44:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:37,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:44:37,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:44:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:44:37,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:44:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-12 00:44:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219917032] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:44:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908428291] [2023-11-12 00:44:37,382 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-12 00:44:37,382 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:44:37,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:44:37,383 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:44:37,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:44:39,029 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 3 for LOIs [2023-11-12 00:44:39,031 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:44:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [908428291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:44:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 24 [2023-11-12 00:44:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593105209] [2023-11-12 00:44:40,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:40,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:44:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:44:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-11-12 00:44:40,037 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:40,977 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-11-12 00:44:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 00:44:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2023-11-12 00:44:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:40,978 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:44:40,978 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:44:40,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2023-11-12 00:44:40,979 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:40,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:44:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:44:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:44:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-12 00:44:40,989 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 28 [2023-11-12 00:44:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:40,989 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-12 00:44:40,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:44:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-12 00:44:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-12 00:44:40,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:44:40,990 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:41,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:44:41,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:44:41,208 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-11-12 00:44:41,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:44:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash -630067071, now seen corresponding path program 1 times [2023-11-12 00:44:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:44:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524276924] [2023-11-12 00:44:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:44:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:44:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:44:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 00:44:41,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:44:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524276924] [2023-11-12 00:44:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524276924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:44:41,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:44:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:44:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394447407] [2023-11-12 00:44:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:44:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:44:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:44:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:44:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:44:41,252 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:44:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:44:41,271 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-11-12 00:44:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:44:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-12 00:44:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:44:41,272 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:44:41,272 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:44:41,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:44:41,273 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:44:41,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:44:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:44:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:44:41,275 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) [2023-11-12 00:44:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:44:41,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-11-12 00:44:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:44:41,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:44:41,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:44:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:44:41,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:44:41,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2023-11-12 00:44:41,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2023-11-12 00:44:41,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2023-11-12 00:44:41,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2023-11-12 00:44:41,279 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2023-11-12 00:44:41,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2023-11-12 00:44:41,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2023-11-12 00:44:41,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2023-11-12 00:44:41,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2023-11-12 00:44:41,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2023-11-12 00:44:41,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:44:41,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:44:42,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,281 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-11-12 00:44:42,281 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-11-12 00:44:42,281 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,281 INFO L899 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point L23-2(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L895 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| 2147483648)) (<= 1 |#StackHeapBarrier|) (= 25 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (<= |ULTIMATE.start_main_~j~0#1| 2147483647) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point L20-3(line 20) no Hoare annotation was computed. [2023-11-12 00:44:42,282 INFO L899 garLoopResultBuilder]: For program point L20-4(line 20) no Hoare annotation was computed. [2023-11-12 00:44:42,283 INFO L895 garLoopResultBuilder]: At program point L20-5(lines 20 24) the Hoare annotation is: (let ((.cse10 (select |#memory_int| 1))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 99999)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (<= |ULTIMATE.start_main_~j~0#1| 9999)) (.cse3 (<= 1 |ULTIMATE.start_main_~j~0#1|)) (.cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#a~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse6 (exists ((|v_#valid_23| (Array Int Int))) (and (= (store |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base| 1) |#valid|) (= (select |v_#valid_23| 1) 1) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| 2) 1) (= (select |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base|) 0) (= (select |v_#valid_23| 3) 1)))) (.cse7 (= (select .cse10 0) 48)) (.cse8 (exists ((|v_#length_6| (Array Int Int))) (and (= (store |v_#length_6| |ULTIMATE.start_main_~#a~0#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4)) |#length|) (= (select |v_#length_6| 2) 25) (= (select |v_#length_6| 1) 2) (= (select |v_#length_6| 3) 12)))) (.cse9 (= (select .cse10 1) 0))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~k~0#1| 9999) .cse2 .cse3 (<= (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|) 2147483647) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~k~0#1|) .cse6 (<= 2 |ULTIMATE.start_main_~n~0#1|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))))) [2023-11-12 00:44:42,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:44:42,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,283 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:44:42,284 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2023-11-12 00:44:42,284 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:44:42,284 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:44:42,284 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2023-11-12 00:44:42,284 INFO L899 garLoopResultBuilder]: For program point L26-3(line 26) no Hoare annotation was computed. [2023-11-12 00:44:42,285 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 99999) (<= 1 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~k~0#1| 2147483648)) (<= |ULTIMATE.start_main_~j~0#1| 9999) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 99998) (let ((.cse0 (exists ((|v_#length_6| (Array Int Int))) (and (= (store |v_#length_6| |ULTIMATE.start_main_~#a~0#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4)) |#length|) (= (select |v_#length_6| 2) 25) (= (select |v_#length_6| 1) 2) (= (select |v_#length_6| 3) 12))))) (or (and (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse0) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (exists ((|v_#valid_23| (Array Int Int))) (and (= (store |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base| 1) |#valid|) (= (select |v_#valid_23| 1) 1) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| 2) 1) (= (select |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base|) 0) (= (select |v_#valid_23| 3) 1))) (<= 2 |ULTIMATE.start_main_~n~0#1|) (= (select .cse1 0) 48) (= (select .cse1 1) 0))) [2023-11-12 00:44:42,285 INFO L899 garLoopResultBuilder]: For program point L26-4(line 26) no Hoare annotation was computed. [2023-11-12 00:44:42,285 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-11-12 00:44:42,285 INFO L895 garLoopResultBuilder]: At program point L26-5(lines 26 27) the Hoare annotation is: (let ((.cse11 (select |#memory_int| 1))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 99999)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (<= |ULTIMATE.start_main_~j~0#1| 9999)) (.cse3 (<= 1 |ULTIMATE.start_main_~j~0#1|)) (.cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#a~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse6 (exists ((|v_#valid_23| (Array Int Int))) (and (= (store |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base| 1) |#valid|) (= (select |v_#valid_23| 1) 1) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| 2) 1) (= (select |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base|) 0) (= (select |v_#valid_23| 3) 1)))) (.cse7 (= (select .cse11 0) 48)) (.cse8 (exists ((|v_#length_6| (Array Int Int))) (and (= (store |v_#length_6| |ULTIMATE.start_main_~#a~0#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4)) |#length|) (= (select |v_#length_6| 2) 25) (= (select |v_#length_6| 1) 2) (= (select |v_#length_6| 3) 12)))) (.cse9 (= (select .cse11 1) 0)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (<= |ULTIMATE.start_main_~i~0#1| 2147483647) .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2023-11-12 00:44:42,285 INFO L895 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 99999) (<= 0 (+ |ULTIMATE.start_main_~j~0#1| 2147483648)) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~j~0#1| 2147483647) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#a~0#1.base|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (exists ((|v_#valid_23| (Array Int Int))) (and (= (store |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base| 1) |#valid|) (= (select |v_#valid_23| 1) 1) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| 2) 1) (= (select |v_#valid_23| |ULTIMATE.start_main_~#a~0#1.base|) 0) (= (select |v_#valid_23| 3) 1))) (= (select .cse0 0) 48) (exists ((|v_#length_6| (Array Int Int))) (and (= (store |v_#length_6| |ULTIMATE.start_main_~#a~0#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4)) |#length|) (= (select |v_#length_6| 2) 25) (= (select |v_#length_6| 1) 2) (= (select |v_#length_6| 3) 12))) (= (select .cse0 1) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) [2023-11-12 00:44:42,285 INFO L899 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2023-11-12 00:44:42,285 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-12 00:44:42,286 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 5 7) the Hoare annotation is: true [2023-11-12 00:44:42,286 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2023-11-12 00:44:42,290 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:44:42,292 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:44:42,317 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,318 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,318 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,318 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,319 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,319 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,319 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,319 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,331 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,332 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,332 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,332 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,341 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,342 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,342 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,343 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,344 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,345 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,345 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,345 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,346 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,347 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,347 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,347 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,348 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,355 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,356 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,356 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:44:42 BoogieIcfgContainer [2023-11-12 00:44:42,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:44:42,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:44:42,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:44:42,357 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:44:42,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:44:23" (3/4) ... [2023-11-12 00:44:42,360 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:44:42,364 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 00:44:42,370 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2023-11-12 00:44:42,372 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-12 00:44:42,372 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 00:44:42,373 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:44:42,480 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:44:42,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:44:42,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:44:42,482 INFO L158 Benchmark]: Toolchain (without parser) took 19869.80ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 104.9MB in the beginning and 150.2MB in the end (delta: -45.3MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,482 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:44:42,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.72ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.85ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 93.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,483 INFO L158 Benchmark]: Boogie Preprocessor took 54.45ms. Allocated memory is still 151.0MB. Free memory was 93.0MB in the beginning and 91.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:44:42,484 INFO L158 Benchmark]: RCFGBuilder took 486.18ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 77.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,484 INFO L158 Benchmark]: TraceAbstraction took 18881.68ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 77.0MB in the beginning and 154.4MB in the end (delta: -77.4MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,484 INFO L158 Benchmark]: Witness Printer took 123.93ms. Allocated memory is still 264.2MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:44:42,486 INFO L338 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 115.3MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.72ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 94.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.85ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 93.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.45ms. Allocated memory is still 151.0MB. Free memory was 93.0MB in the beginning and 91.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 486.18ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 77.7MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18881.68ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 77.0MB in the beginning and 154.4MB in the end (delta: -77.4MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. * Witness Printer took 123.93ms. Allocated memory is still 264.2MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated * 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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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 2 procedures, 31 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 876 IncrementalHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 180 mSDtfsCounter, 876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 260 SyntacticMatches, 10 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 72 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 8 PreInvPairs, 12 NumberOfFragments, 743 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1165 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1307 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 10 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 179/231 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: OVERALL_TIME: 4.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 60, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME: 1.5s, TOOLS_POST_CALL_APPLICATIONS: 43, TOOLS_POST_CALL_TIME: 1.1s, TOOLS_POST_RETURN_APPLICATIONS: 34, TOOLS_POST_RETURN_TIME: 0.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 178, TOOLS_QUANTIFIERELIM_TIME: 3.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 226, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 45, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 60, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 2.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 34, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1063, DAG_COMPRESSION_RETAINED_NODES: 174, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2023-11-12 00:44:42,501 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,501 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,501 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,502 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,502 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,502 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,502 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,502 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,504 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,504 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,504 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,504 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,504 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,505 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,505 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,505 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: (((((((((n <= 99999) && (k <= 9999)) && (j <= 9999)) && (1 <= j)) && ((i + j) <= 2147483647)) && (2 <= i)) && (1 <= k)) && (2 <= n)) || (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1)) && (0 <= (n + 2147483648)))) - InvariantResult [Line: 26]: Loop Invariant [2023-11-12 00:44:42,506 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,506 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,507 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,507 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,507 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,507 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,507 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,508 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,509 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,509 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,509 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,509 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:44:42,509 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_23 : [int]int :: ((((v_#valid_23[~#a~0!base := 1] == #valid && v_#valid_23[1] == 1) && v_#valid_23[0] == 0) && v_#valid_23[2] == 1) && v_#valid_23[~#a~0!base] == 0) && v_#valid_23[3] == 1) could not be translated [2023-11-12 00:44:42,510 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:44:42,510 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_6 : [int]int :: ((v_#length_6[~#a~0!base := ~n~0 % 1073741824 * 4] == #length && v_#length_6[2] == 25) && v_#length_6[1] == 2) && v_#length_6[3] == 12) could not be translated [2023-11-12 00:44:42,510 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: ((((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1)) && (0 <= (n + 2147483648))) || ((((((n <= 99999) && (i <= 2147483647)) && (j <= 9999)) && (1 <= j)) && (2 <= i)) && (0 <= (n + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:44:42,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6b6e5d2-c82f-4e52-b3b1-53ba1ae966b0/bin/utaipan-verify-NcY6lQBIFX/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