./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/rewrev.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_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/rewrev.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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 40cb4a1cdff0a4e27345697e0d771f8cc035da7ed4f2bd40d71a1d68f6e99f3f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:41:54,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:41:54,628 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:41:54,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:41:54,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:41:54,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:41:54,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:41:54,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:41:54,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:41:54,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:41:54,711 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:41:54,712 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:41:54,712 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:41:54,713 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:41:54,713 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:41:54,714 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:41:54,714 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:41:54,715 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:41:54,716 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:41:54,716 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:41:54,717 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:41:54,717 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:41:54,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:41:54,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:41:54,719 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:41:54,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:41:54,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:41:54,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:41:54,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:41:54,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:41:54,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:41:54,722 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:41:54,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:41:54,723 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:41:54,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:41:54,724 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:41:54,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:41:54,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:41:54,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:41:54,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:41:54,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:41:54,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:41:54,738 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:41:54,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:41:54,739 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:41:54,739 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:41:54,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:41:54,740 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_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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 -> 40cb4a1cdff0a4e27345697e0d771f8cc035da7ed4f2bd40d71a1d68f6e99f3f [2023-11-12 00:41:55,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:41:55,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:41:55,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:41:55,164 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:41:55,164 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:41:55,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/array-tiling/rewrev.c [2023-11-12 00:41:58,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:41:58,509 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:41:58,510 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/sv-benchmarks/c/array-tiling/rewrev.c [2023-11-12 00:41:58,517 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/data/196b3e235/8845429df9c844809aa744b11037c0ca/FLAG9c78e9705 [2023-11-12 00:41:58,530 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/data/196b3e235/8845429df9c844809aa744b11037c0ca [2023-11-12 00:41:58,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:41:58,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:41:58,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:41:58,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:41:58,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:41:58,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625f84cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58, skipping insertion in model container [2023-11-12 00:41:58,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,566 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:41:58,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:41:58,790 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:41:58,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:41:58,842 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:41:58,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58 WrapperNode [2023-11-12 00:41:58,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:41:58,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:41:58,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:41:58,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:41:58,856 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:41:58" (1/1) ... [2023-11-12 00:41:58,862 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:41:58" (1/1) ... [2023-11-12 00:41:58,890 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2023-11-12 00:41:58,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:41:58,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:41:58,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:41:58,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:41:58,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:41:58,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:41:58,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:41:58,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:41:58,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (1/1) ... [2023-11-12 00:41:58,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:41:58,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:41:58,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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:41:59,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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:41:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:41:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:41:59,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:41:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:41:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:41:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:41:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:41:59,123 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:41:59,125 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:41:59,413 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:41:59,469 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:41:59,469 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:41:59,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:41:59 BoogieIcfgContainer [2023-11-12 00:41:59,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:41:59,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:41:59,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:41:59,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:41:59,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:41:58" (1/3) ... [2023-11-12 00:41:59,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45492418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:41:59, skipping insertion in model container [2023-11-12 00:41:59,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:41:58" (2/3) ... [2023-11-12 00:41:59,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45492418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:41:59, skipping insertion in model container [2023-11-12 00:41:59,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:41:59" (3/3) ... [2023-11-12 00:41:59,481 INFO L112 eAbstractionObserver]: Analyzing ICFG rewrev.c [2023-11-12 00:41:59,503 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:41:59,503 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-12 00:41:59,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:41:59,562 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;@28d3716c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:41:59,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 00:41:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:41:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:41:59,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:41:59,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:41:59,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:41:59,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:41:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 104910, now seen corresponding path program 1 times [2023-11-12 00:41:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:41:59,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97056459] [2023-11-12 00:41:59,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:41:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:41:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:41:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:41:59,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:41:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97056459] [2023-11-12 00:41:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97056459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:41:59,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:41:59,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:41:59,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832358465] [2023-11-12 00:41:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:41:59,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:41:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:41:59,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:41:59,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:41:59,828 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:41:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:41:59,878 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-11-12 00:41:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:41:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-12 00:41:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:41:59,889 INFO L225 Difference]: With dead ends: 24 [2023-11-12 00:41:59,890 INFO L226 Difference]: Without dead ends: 19 [2023-11-12 00:41:59,893 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:41:59,897 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:41:59,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:41:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-12 00:41:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-12 00:41:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:41:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-11-12 00:41:59,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 3 [2023-11-12 00:41:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:41:59,933 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-11-12 00:41:59,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:41:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-11-12 00:41:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:41:59,934 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:41:59,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:41:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:41:59,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:41:59,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:41:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 3252249, now seen corresponding path program 1 times [2023-11-12 00:41:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:41:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067204070] [2023-11-12 00:41:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:41:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:41:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067204070] [2023-11-12 00:42:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067204070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:42:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275504399] [2023-11-12 00:42:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:00,013 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,036 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-11-12 00:42:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-12 00:42:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,038 INFO L225 Difference]: With dead ends: 19 [2023-11-12 00:42:00,038 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 00:42:00,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:00,040 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:00,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 00:42:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-12 00:42:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 17 states have internal predecessors, (19), 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:42:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-11-12 00:42:00,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 4 [2023-11-12 00:42:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,047 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-11-12 00:42:00,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-11-12 00:42:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:42:00,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:42:00,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1169552356, now seen corresponding path program 1 times [2023-11-12 00:42:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805087655] [2023-11-12 00:42:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805087655] [2023-11-12 00:42:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805087655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:42:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567881790] [2023-11-12 00:42:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:00,146 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,186 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-11-12 00:42:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:00,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:42:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,188 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:42:00,189 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:42:00,189 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:42:00,191 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:00,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:42:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2023-11-12 00:42:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 16 states have internal predecessors, (18), 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:42:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-12 00:42:00,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 6 [2023-11-12 00:42:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,200 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-12 00:42:00,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-11-12 00:42:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:42:00,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:42:00,202 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1896386438, now seen corresponding path program 1 times [2023-11-12 00:42:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713773896] [2023-11-12 00:42:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713773896] [2023-11-12 00:42:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713773896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:42:00,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801482296] [2023-11-12 00:42:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:00,324 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,379 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-11-12 00:42:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:42:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,381 INFO L225 Difference]: With dead ends: 34 [2023-11-12 00:42:00,381 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:42:00,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:42:00,383 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:00,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:42:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2023-11-12 00:42:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 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:42:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-11-12 00:42:00,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 7 [2023-11-12 00:42:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,395 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-11-12 00:42:00,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-11-12 00:42:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:42:00,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:42:00,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1896384611, now seen corresponding path program 1 times [2023-11-12 00:42:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847709203] [2023-11-12 00:42:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847709203] [2023-11-12 00:42:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847709203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:42:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19999483] [2023-11-12 00:42:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:00,526 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,585 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-12 00:42:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:42:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,587 INFO L225 Difference]: With dead ends: 30 [2023-11-12 00:42:00,587 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:42:00,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:42:00,590 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:00,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:42:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-11-12 00:42:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-12 00:42:00,597 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 7 [2023-11-12 00:42:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,598 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-12 00:42:00,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-12 00:42:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:42:00,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:42:00,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1341620783, now seen corresponding path program 1 times [2023-11-12 00:42:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859068345] [2023-11-12 00:42:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859068345] [2023-11-12 00:42:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859068345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643118789] [2023-11-12 00:42:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:00,748 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:42:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,827 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-11-12 00:42:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 00:42:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,828 INFO L225 Difference]: With dead ends: 25 [2023-11-12 00:42:00,828 INFO L226 Difference]: Without dead ends: 24 [2023-11-12 00:42:00,829 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:42:00,830 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:00,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-12 00:42:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2023-11-12 00:42:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-11-12 00:42:00,836 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 8 [2023-11-12 00:42:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,836 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-11-12 00:42:00,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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:42:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-11-12 00:42:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:42:00,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:42:00,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1359428624, now seen corresponding path program 1 times [2023-11-12 00:42:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839679821] [2023-11-12 00:42:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:00,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839679821] [2023-11-12 00:42:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839679821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:42:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439121396] [2023-11-12 00:42:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:00,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:42:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:42:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:42:00,883 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:00,903 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-11-12 00:42:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:42:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:42:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:00,904 INFO L225 Difference]: With dead ends: 19 [2023-11-12 00:42:00,904 INFO L226 Difference]: Without dead ends: 18 [2023-11-12 00:42:00,905 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:42:00,906 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 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:42:00,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-12 00:42:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-12 00:42:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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:42:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-11-12 00:42:00,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 9 [2023-11-12 00:42:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:00,916 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-11-12 00:42:00,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-11-12 00:42:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:42:00,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:00,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:00,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:42:00,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:00,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1491392189, now seen corresponding path program 1 times [2023-11-12 00:42:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:00,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525097974] [2023-11-12 00:42:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:01,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:01,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525097974] [2023-11-12 00:42:01,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525097974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:01,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:01,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:42:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881219521] [2023-11-12 00:42:01,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:01,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:42:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:01,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:42:01,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:42:01,058 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:42:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:01,121 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-11-12 00:42:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:42:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:42:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:01,122 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:42:01,122 INFO L226 Difference]: Without dead ends: 21 [2023-11-12 00:42:01,123 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:42:01,124 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:01,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-12 00:42:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-12 00:42:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 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:42:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-11-12 00:42:01,130 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2023-11-12 00:42:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:01,130 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-11-12 00:42:01,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:42:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-11-12 00:42:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:42:01,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:01,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:01,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:42:01,132 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:01,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1491390362, now seen corresponding path program 1 times [2023-11-12 00:42:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691139440] [2023-11-12 00:42:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:01,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691139440] [2023-11-12 00:42:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691139440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:42:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:42:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025725206] [2023-11-12 00:42:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:01,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:42:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:42:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:42:01,221 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:42:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:01,314 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2023-11-12 00:42:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:42:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:42:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:01,317 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:42:01,317 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:42:01,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:42:01,318 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:01,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 11 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:42:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:42:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-11-12 00:42:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 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:42:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-11-12 00:42:01,324 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2023-11-12 00:42:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:01,324 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-11-12 00:42:01,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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:42:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-11-12 00:42:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:42:01,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:01,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:01,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:42:01,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:01,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1372066812, now seen corresponding path program 1 times [2023-11-12 00:42:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554335407] [2023-11-12 00:42:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:42:01,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554335407] [2023-11-12 00:42:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554335407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120352072] [2023-11-12 00:42:01,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:01,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:01,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:01,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:01,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:42:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:01,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:42:01,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:42:01,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:42:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120352072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:42:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [807965498] [2023-11-12 00:42:01,631 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:42:01,631 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:01,635 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:01,641 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:01,642 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:03,436 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [807965498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:42:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:42:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6, 6] total 14 [2023-11-12 00:42:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854213584] [2023-11-12 00:42:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:42:04,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:42:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:04,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:42:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2023-11-12 00:42:04,009 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:05,149 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-11-12 00:42:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 00:42:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:42:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:05,150 INFO L225 Difference]: With dead ends: 22 [2023-11-12 00:42:05,150 INFO L226 Difference]: Without dead ends: 21 [2023-11-12 00:42:05,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2023-11-12 00:42:05,151 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:05,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-12 00:42:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2023-11-12 00:42:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:42:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-12 00:42:05,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2023-11-12 00:42:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:05,160 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-12 00:42:05,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-11-12 00:42:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:42:05,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:05,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:05,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:05,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:42:05,368 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:05,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -415601696, now seen corresponding path program 1 times [2023-11-12 00:42:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:05,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403176420] [2023-11-12 00:42:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:42:05,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403176420] [2023-11-12 00:42:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403176420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368920603] [2023-11-12 00:42:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:05,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:05,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:42:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:05,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:42:05,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:42:05,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 00:42:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368920603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:42:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564024448] [2023-11-12 00:42:05,627 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:42:05,627 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:05,628 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:05,628 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:05,628 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:06,675 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:07,209 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '786#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= ~MAX~0 100000) (<= 2 ~SIZE~0) (<= 2147483647 |ULTIMATE.start_main_#t~post7#1|) (= |ULTIMATE.start_main_~low~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~val2~0#1|) (= 7 |ULTIMATE.start_main_~val1~0#1|) (<= ~SIZE~0 99999))' at error location [2023-11-12 00:42:07,209 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:07,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:42:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2023-11-12 00:42:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663059357] [2023-11-12 00:42:07,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:07,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:42:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:42:07,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=281, Unknown=2, NotChecked=0, Total=342 [2023-11-12 00:42:07,225 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:42:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:07,399 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-11-12 00:42:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:42:07,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-12 00:42:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:07,405 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:42:07,406 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:42:07,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=522, Unknown=2, NotChecked=0, Total=650 [2023-11-12 00:42:07,407 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:07,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 12 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:07,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:42:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:42:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:42:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-11-12 00:42:07,424 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2023-11-12 00:42:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:07,424 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-11-12 00:42:07,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:42:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-11-12 00:42:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:42:07,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:42:07,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:07,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:07,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:42:07,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-12 00:42:07,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:42:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1262410398, now seen corresponding path program 2 times [2023-11-12 00:42:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:42:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240255584] [2023-11-12 00:42:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:42:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:42:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:42:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:42:07,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:42:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240255584] [2023-11-12 00:42:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240255584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:42:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316828242] [2023-11-12 00:42:07,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:42:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:42:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:42:07,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:42:07,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:42:07,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:42:07,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:42:07,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:42:07,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:42:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:42:07,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:42:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:42:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316828242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:42:08,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717651232] [2023-11-12 00:42:08,037 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:42:08,037 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:42:08,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:42:08,038 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:42:08,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:42:08,978 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:42:09,627 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1032#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= ~MAX~0 100000) (<= 2 ~SIZE~0) (<= 2147483647 |ULTIMATE.start_main_#t~post7#1|) (= |ULTIMATE.start_main_~low~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~val2~0#1|) (= 7 |ULTIMATE.start_main_~val1~0#1|) (<= ~SIZE~0 99999))' at error location [2023-11-12 00:42:09,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:42:09,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:42:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 2, 2] total 14 [2023-11-12 00:42:09,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258205769] [2023-11-12 00:42:09,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:42:09,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 00:42:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:42:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 00:42:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=431, Unknown=1, NotChecked=0, Total=506 [2023-11-12 00:42:09,630 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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:42:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:42:09,904 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2023-11-12 00:42:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:42:09,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-12 00:42:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:42:09,905 INFO L225 Difference]: With dead ends: 44 [2023-11-12 00:42:09,905 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:42:09,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=886, Unknown=1, NotChecked=0, Total=1056 [2023-11-12 00:42:09,906 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:42:09,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:42:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:42:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:42:09,907 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:42:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:42:09,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2023-11-12 00:42:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:42:09,908 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:42:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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:42:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:42:09,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:42:09,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-12 00:42:09,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-12 00:42:09,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-12 00:42:09,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:42:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:42:10,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:42:10,812 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2023-11-12 00:42:10,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2023-11-12 00:42:10,812 INFO L899 garLoopResultBuilder]: For program point L35-4(line 35) no Hoare annotation was computed. [2023-11-12 00:42:10,813 INFO L895 garLoopResultBuilder]: At program point L35-5(lines 35 38) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 9) (= (select |v_#length_7| 3) 12))) (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= ~MAX~0 100000) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (<= 2 ~SIZE~0) (not (= |ULTIMATE.start_main_~a~0#1.base| 0)) (= |ULTIMATE.start_main_~low~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~val2~0#1|) (= 7 |ULTIMATE.start_main_~val1~0#1|) (<= ~SIZE~0 99999) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) [2023-11-12 00:42:10,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2023-11-12 00:42:10,813 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-12 00:42:10,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,813 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,814 INFO L899 garLoopResultBuilder]: For program point L26-5(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,815 INFO L899 garLoopResultBuilder]: For program point L26-6(line 26) no Hoare annotation was computed. [2023-11-12 00:42:10,815 INFO L895 garLoopResultBuilder]: At program point L26-7(lines 26 33) the Hoare annotation is: (let ((.cse13 (select |#memory_int| 1))) (let ((.cse0 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 9) (= (select |v_#length_7| 3) 12)))) (.cse1 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse4 (= ~MAX~0 100000)) (.cse5 (<= 2 ~SIZE~0)) (.cse6 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_main_~low~0#1| 2)) (.cse8 (= 3 |ULTIMATE.start_main_~val2~0#1|)) (.cse9 (= 7 |ULTIMATE.start_main_~val1~0#1|)) (.cse10 (= (select .cse13 0) 48)) (.cse11 (= (select .cse13 1) 0)) (.cse12 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 99996) .cse4 .cse5 (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) .cse6 .cse7 .cse8 .cse9 (<= ~SIZE~0 99999) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_main_~i~0#1| 99997) .cse10 .cse11 .cse12 (<= ~SIZE~0 (+ 2 |ULTIMATE.start_main_~i~0#1|)))))) [2023-11-12 00:42:10,815 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 39) no Hoare annotation was computed. [2023-11-12 00:42:10,815 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 18 39) no Hoare annotation was computed. [2023-11-12 00:42:10,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2023-11-12 00:42:10,819 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:42:10,821 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:42:10,837 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,838 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,843 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,843 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,845 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,845 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,847 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,847 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,849 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,849 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,849 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,850 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:10,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:10,851 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:10,852 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:10,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:42:10 BoogieIcfgContainer [2023-11-12 00:42:10,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:42:10,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:42:10,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:42:10,853 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:42:10,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:41:59" (3/4) ... [2023-11-12 00:42:10,859 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:42:10,871 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2023-11-12 00:42:10,871 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-12 00:42:10,872 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 00:42:10,872 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:42:11,001 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:42:11,002 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:42:11,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:42:11,003 INFO L158 Benchmark]: Toolchain (without parser) took 12467.95ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 146.8MB in the beginning and 174.1MB in the end (delta: -27.4MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,004 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:42:11,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.62ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 136.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.87ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,005 INFO L158 Benchmark]: Boogie Preprocessor took 43.43ms. Allocated memory is still 178.3MB. Free memory was 134.4MB in the beginning and 133.4MB in the end (delta: 987.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,006 INFO L158 Benchmark]: RCFGBuilder took 537.03ms. Allocated memory is still 178.3MB. Free memory was 132.8MB in the beginning and 141.4MB in the end (delta: -8.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,006 INFO L158 Benchmark]: TraceAbstraction took 11377.95ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 140.9MB in the beginning and 179.4MB in the end (delta: -38.5MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,007 INFO L158 Benchmark]: Witness Printer took 149.24ms. Allocated memory is still 264.2MB. Free memory was 179.4MB in the beginning and 174.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:42:11,012 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.30ms. Allocated memory is still 127.9MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.62ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 136.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.87ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 134.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.43ms. Allocated memory is still 178.3MB. Free memory was 134.4MB in the beginning and 133.4MB in the end (delta: 987.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.03ms. Allocated memory is still 178.3MB. Free memory was 132.8MB in the beginning and 141.4MB in the end (delta: -8.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11377.95ms. Allocated memory was 178.3MB in the beginning and 264.2MB in the end (delta: 86.0MB). Free memory was 140.9MB in the beginning and 179.4MB in the end (delta: -38.5MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * Witness Printer took 149.24ms. Allocated memory is still 264.2MB. Free memory was 179.4MB in the beginning and 174.1MB in the end (delta: 5.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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] 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: 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 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: 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 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 84 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 126 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 344 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1548 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 814 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 178 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 557 SizeOfPredicates, 7 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 46/73 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: 1.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 12, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 40, TOOLS_POST_TIME: 1.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 40, TOOLS_QUANTIFIERELIM_TIME: 1.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 68, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 12, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 1.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, 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: 195, DAG_COMPRESSION_RETAINED_NODES: 45, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2023-11-12 00:42:11,035 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,035 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,036 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,036 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:11,036 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,037 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,037 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,037 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:11,039 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,039 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,040 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,040 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:11,040 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,040 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,041 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,041 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: (((((((((i <= 99996) && (MAX == 100000)) && (2 <= SIZE)) && (0 <= (i + 2147483648))) && (low == 2)) && (3 == val2)) && (7 == val1)) && (SIZE <= 99999)) || (((((((MAX == 100000) && (2 <= SIZE)) && (low == 2)) && (3 == val2)) && (7 == val1)) && (i <= 99997)) && (SIZE <= (2 + i)))) - InvariantResult [Line: 35]: Loop Invariant [2023-11-12 00:42:11,042 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,042 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,043 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,043 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:42:11,044 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 9) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:42:11,044 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:42:11,045 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:42:11,045 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: ((((((((MAX == 100000) && (i <= 2147483647)) && (2 <= SIZE)) && (low == 2)) && (0 <= i)) && (3 == val2)) && (7 == val1)) && (SIZE <= 99999)) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:42:11,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85f5ba6-fdfb-452c-9a53-af1e9cd4b1d7/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