./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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 eb589a592aff310a2662d7a22b89559cebd75929901bc5e2cc7816fe45d47c92 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:51:39,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:51:39,831 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:51:39,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:51:39,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:51:39,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:51:39,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:51:39,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:51:39,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:51:39,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:51:39,884 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:51:39,885 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:51:39,886 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:51:39,886 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:51:39,887 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:51:39,887 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:51:39,888 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:51:39,889 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:51:39,889 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:51:39,890 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:51:39,890 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:51:39,891 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:51:39,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:51:39,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:51:39,893 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:51:39,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:51:39,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:51:39,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:51:39,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:51:39,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:51:39,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:51:39,896 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:51:39,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:51:39,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:51:39,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:51:39,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:51:39,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:51:39,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:51:39,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:39,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:51:39,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:51:39,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:51:39,899 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:51:39,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:51:39,900 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:51:39,900 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:51:39,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:51:39,900 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_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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 -> eb589a592aff310a2662d7a22b89559cebd75929901bc5e2cc7816fe45d47c92 [2023-11-12 00:51:40,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:51:40,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:51:40,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:51:40,172 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:51:40,173 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:51:40,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2023-11-12 00:51:43,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:51:43,523 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:51:43,525 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength.c [2023-11-12 00:51:43,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/data/0f7fb254f/fe792bc630d340dfb0f7238c82085d66/FLAG5bf906162 [2023-11-12 00:51:43,544 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/data/0f7fb254f/fe792bc630d340dfb0f7238c82085d66 [2023-11-12 00:51:43,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:51:43,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:51:43,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:43,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:51:43,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:51:43,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c24252d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43, skipping insertion in model container [2023-11-12 00:51:43,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,578 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:51:43,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:43,736 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:51:43,752 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:43,767 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:51:43,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43 WrapperNode [2023-11-12 00:51:43,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:43,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:43,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:51:43,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:51:43,777 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:51:43" (1/1) ... [2023-11-12 00:51:43,785 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:51:43" (1/1) ... [2023-11-12 00:51:43,806 INFO L138 Inliner]: procedures = 8, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-11-12 00:51:43,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:43,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:51:43,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:51:43,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:51:43,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:51:43,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:51:43,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:51:43,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:51:43,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (1/1) ... [2023-11-12 00:51:43,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:43,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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:51:43,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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:51:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:51:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:51:43,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:51:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:51:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:51:43,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:51:43,987 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:51:43,990 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:51:44,161 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:51:44,200 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:51:44,200 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:51:44,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:44 BoogieIcfgContainer [2023-11-12 00:51:44,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:51:44,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:51:44,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:51:44,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:51:44,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:51:43" (1/3) ... [2023-11-12 00:51:44,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d46717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:44, skipping insertion in model container [2023-11-12 00:51:44,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:43" (2/3) ... [2023-11-12 00:51:44,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d46717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:44, skipping insertion in model container [2023-11-12 00:51:44,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:44" (3/3) ... [2023-11-12 00:51:44,214 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength.c [2023-11-12 00:51:44,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:51:44,232 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 00:51:44,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:51:44,279 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;@1654e001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:51:44,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 00:51:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 18 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:51:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:51:44,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:44,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:51:44,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:44,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash 3080398, now seen corresponding path program 1 times [2023-11-12 00:51:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999213256] [2023-11-12 00:51:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:44,737 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:51:44,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999213256] [2023-11-12 00:51:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999213256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:44,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040444130] [2023-11-12 00:51:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:44,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:44,784 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 18 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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:51:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:44,904 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-11-12 00:51:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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:51:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:44,914 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:51:44,915 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:51:44,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:44,925 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:44,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:51:44,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2023-11-12 00:51:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 18 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:51:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-12 00:51:44,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 4 [2023-11-12 00:51:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-12 00:51:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 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:51:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-12 00:51:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:51:44,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:44,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:51:44,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:51:44,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:44,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 3080565, now seen corresponding path program 1 times [2023-11-12 00:51:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230064655] [2023-11-12 00:51:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:45,102 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:51:45,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230064655] [2023-11-12 00:51:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230064655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:45,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:45,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:51:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383482908] [2023-11-12 00:51:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:45,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:45,106 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:51:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:45,161 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-11-12 00:51:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:45,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:51:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:45,163 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:51:45,163 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:51:45,164 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:51:45,166 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:45,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:51:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2023-11-12 00:51:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 20 states have internal predecessors, (23), 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:51:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-11-12 00:51:45,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 4 [2023-11-12 00:51:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:45,173 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-11-12 00:51:45,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:51:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-11-12 00:51:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:51:45,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:45,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:51:45,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:45,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1700127335, now seen corresponding path program 1 times [2023-11-12 00:51:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843173177] [2023-11-12 00:51:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:45,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843173177] [2023-11-12 00:51:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843173177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:45,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649228171] [2023-11-12 00:51:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:45,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:45,278 INFO L87 Difference]: Start difference. First operand 21 states and 23 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:51:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:45,311 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-12 00:51:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:45,311 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:51:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:45,312 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:51:45,312 INFO L226 Difference]: Without dead ends: 24 [2023-11-12 00:51:45,313 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:51:45,314 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 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.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:45,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-12 00:51:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-12 00:51:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 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:51:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-12 00:51:45,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2023-11-12 00:51:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:45,321 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-12 00:51:45,321 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:51:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-12 00:51:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:51:45,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:45,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2023-11-12 00:51:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:51:45,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:45,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1700127502, now seen corresponding path program 1 times [2023-11-12 00:51:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759342970] [2023-11-12 00:51:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:45,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:45,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759342970] [2023-11-12 00:51:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759342970] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654926513] [2023-11-12 00:51:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:45,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:45,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:45,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:51:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:45,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 00:51:45,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:45,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654926513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1236191359] [2023-11-12 00:51:45,772 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2023-11-12 00:51:45,772 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:45,776 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:45,782 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:45,783 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:46,096 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1236191359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:46,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5, 5] total 13 [2023-11-12 00:51:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832361396] [2023-11-12 00:51:46,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:46,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:46,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:46,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:46,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-12 00:51:46,544 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:51:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:46,631 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-12 00:51:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 8 [2023-11-12 00:51:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:46,633 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:51:46,634 INFO L226 Difference]: Without dead ends: 30 [2023-11-12 00:51:46,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-12 00:51:46,636 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:46,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-12 00:51:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2023-11-12 00:51:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 25 states have internal predecessors, (30), 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:51:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-12 00:51:46,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2023-11-12 00:51:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:46,647 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-12 00:51:46,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:51:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-12 00:51:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:51:46,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:46,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:46,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:51:46,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:46,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:46,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2055829573, now seen corresponding path program 1 times [2023-11-12 00:51:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843347708] [2023-11-12 00:51:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:46,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843347708] [2023-11-12 00:51:47,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843347708] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:47,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972486620] [2023-11-12 00:51:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:47,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:47,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:47,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:47,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:51:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:47,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:47,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:47,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972486620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:51:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-12 00:51:47,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733066220] [2023-11-12 00:51:47,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:47,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:51:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:51:47,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:51:47,132 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:47,223 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-12 00:51:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-12 00:51:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:47,225 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:51:47,225 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:51:47,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:51:47,226 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:47,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:51:47,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:51:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 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:51:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-12 00:51:47,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2023-11-12 00:51:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:47,237 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-12 00:51:47,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-12 00:51:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:51:47,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:47,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:47,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:47,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:47,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:47,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2055829406, now seen corresponding path program 1 times [2023-11-12 00:51:47,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:47,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760086314] [2023-11-12 00:51:47,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:47,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760086314] [2023-11-12 00:51:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760086314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:47,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039516852] [2023-11-12 00:51:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:47,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:47,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:47,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:51:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:47,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:47,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:47,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039516852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:47,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:51:47,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-12 00:51:47,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722235224] [2023-11-12 00:51:47,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:47,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:51:47,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:51:47,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:51:47,691 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:47,754 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-11-12 00:51:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-12 00:51:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:47,756 INFO L225 Difference]: With dead ends: 33 [2023-11-12 00:51:47,756 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 00:51:47,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:51:47,757 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:47,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 00:51:47,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-11-12 00:51:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-12 00:51:47,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2023-11-12 00:51:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:47,772 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-12 00:51:47,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-12 00:51:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:51:47,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:47,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:47,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 00:51:47,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:47,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:47,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash 693792731, now seen corresponding path program 1 times [2023-11-12 00:51:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547249658] [2023-11-12 00:51:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:48,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547249658] [2023-11-12 00:51:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547249658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88083370] [2023-11-12 00:51:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:48,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:48,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:51:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:48,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:48,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:48,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:48,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88083370] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236931870] [2023-11-12 00:51:48,232 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:51:48,232 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:48,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:48,233 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:48,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:50,499 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:51,613 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '687#(and (<= 1 |ULTIMATE.start_foo_~n#1|) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2147483647 |ULTIMATE.start_foo_#t~post0#1|) (<= 1 |ULTIMATE.start_foo_#in~n#1|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-11-12 00:51:51,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:51:51,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-12 00:51:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602764480] [2023-11-12 00:51:51,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:51:51,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:51:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:51,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:51:51,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:51:51,616 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 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:51:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:51,742 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-11-12 00:51:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:51:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 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:51:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:51,745 INFO L225 Difference]: With dead ends: 34 [2023-11-12 00:51:51,745 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 00:51:51,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:51:51,747 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:51,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 00:51:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-12 00:51:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 32 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:51:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-11-12 00:51:51,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 12 [2023-11-12 00:51:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:51,758 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-12 00:51:51,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 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:51:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-11-12 00:51:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:51:51,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:51,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:51,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:51,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:51,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:51,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash 693797920, now seen corresponding path program 1 times [2023-11-12 00:51:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633190347] [2023-11-12 00:51:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:52,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633190347] [2023-11-12 00:51:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633190347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503230443] [2023-11-12 00:51:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:52,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:52,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:51:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:52,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:52,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:52,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:51:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503230443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1028515429] [2023-11-12 00:51:52,290 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:51:52,290 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:52,290 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:52,290 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:52,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:53,529 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:53,952 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '869#(and (<= 2147483647 |ULTIMATE.start_main_#t~post2#1|) (<= |ULTIMATE.start_foo_#res#1| 2147483647) (exists ((|v_#memory_int_47| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_main_~#b~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) |ULTIMATE.start_foo_#res#1|)))) (<= 0 (+ |ULTIMATE.start_foo_#res#1| 2147483648)) (= |ULTIMATE.start_main_#t~post2#1| |ULTIMATE.start_main_~i~1#1|))' at error location [2023-11-12 00:51:53,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:51:53,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-12 00:51:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286732917] [2023-11-12 00:51:53,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:51:53,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 00:51:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 00:51:53,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=279, Unknown=2, NotChecked=0, Total=342 [2023-11-12 00:51:53,955 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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:51:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:54,095 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2023-11-12 00:51:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:51:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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:51:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:54,097 INFO L225 Difference]: With dead ends: 64 [2023-11-12 00:51:54,097 INFO L226 Difference]: Without dead ends: 63 [2023-11-12 00:51:54,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=403, Unknown=5, NotChecked=0, Total=506 [2023-11-12 00:51:54,098 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:54,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 39 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-12 00:51:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 32. [2023-11-12 00:51:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 31 states have internal predecessors, (39), 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:51:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-11-12 00:51:54,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2023-11-12 00:51:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:54,109 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-11-12 00:51:54,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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:51:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-11-12 00:51:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:51:54,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:54,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:54,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:54,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:54,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 846022905, now seen corresponding path program 1 times [2023-11-12 00:51:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009511739] [2023-11-12 00:51:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:51:54,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:54,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009511739] [2023-11-12 00:51:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009511739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:54,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:54,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436493062] [2023-11-12 00:51:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:54,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:54,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:54,384 INFO L87 Difference]: Start difference. First operand 32 states and 39 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:51:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:54,430 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-12 00:51:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:54,431 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 16 [2023-11-12 00:51:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:54,432 INFO L225 Difference]: With dead ends: 40 [2023-11-12 00:51:54,432 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:51:54,433 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:51:54,434 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:54,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:51:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-11-12 00:51:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 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:51:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-11-12 00:51:54,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 16 [2023-11-12 00:51:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:54,446 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-11-12 00:51:54,446 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:51:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-11-12 00:51:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:51:54,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:54,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:51:54,448 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:54,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 946385762, now seen corresponding path program 1 times [2023-11-12 00:51:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:54,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889345133] [2023-11-12 00:51:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:51:54,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889345133] [2023-11-12 00:51:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889345133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:54,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209079284] [2023-11-12 00:51:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:54,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:54,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:54,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:51:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:54,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:54,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:51:54,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 00:51:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209079284] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726582415] [2023-11-12 00:51:54,804 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:51:54,804 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:54,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:54,805 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:54,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:56,320 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [726582415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:57,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 6, 6] total 22 [2023-11-12 00:51:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959436669] [2023-11-12 00:51:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:57,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:51:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:51:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-11-12 00:51:57,302 INFO L87 Difference]: Start difference. First operand 36 states and 43 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:51:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:57,744 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-11-12 00:51:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:51:57,745 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 20 [2023-11-12 00:51:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:57,745 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:51:57,745 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:51:57,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=688, Unknown=1, NotChecked=0, Total=812 [2023-11-12 00:51:57,747 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:57,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:51:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2023-11-12 00:51:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:51:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-11-12 00:51:57,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 20 [2023-11-12 00:51:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:57,755 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-11-12 00:51:57,756 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:51:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-11-12 00:51:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:57,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:57,757 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1] [2023-11-12 00:51:57,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:57,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:57,963 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:51:57,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1051735121, now seen corresponding path program 2 times [2023-11-12 00:51:57,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:57,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631152662] [2023-11-12 00:51:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:57,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 00:51:58,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631152662] [2023-11-12 00:51:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631152662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840093602] [2023-11-12 00:51:58,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:51:58,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:58,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:58,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-12 00:51:58,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:51:58,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:51:58,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:58,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-12 00:51:58,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-12 00:51:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840093602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877705038] [2023-11-12 00:51:58,256 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-12 00:51:58,256 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:58,257 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:58,257 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:58,257 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:59,388 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:52:00,573 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1475#(and (<= 1 |ULTIMATE.start_foo_~n#1|) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2147483647 |ULTIMATE.start_foo_#t~post0#1|) (<= 1 |ULTIMATE.start_foo_#in~n#1|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-11-12 00:52:00,573 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:52:00,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:00,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 12 [2023-11-12 00:52:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26207460] [2023-11-12 00:52:00,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:00,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:52:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:00,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:52:00,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-12 00:52:00,576 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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:52:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:00,745 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2023-11-12 00:52:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:52:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 21 [2023-11-12 00:52:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:00,745 INFO L225 Difference]: With dead ends: 49 [2023-11-12 00:52:00,746 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:52:00,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2023-11-12 00:52:00,747 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:52:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:52:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:52:00,748 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:52:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:52:00,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-11-12 00:52:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:00,748 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:52:00,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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:52:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:52:00,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:52:00,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-12 00:52:00,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-12 00:52:00,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-12 00:52:00,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-12 00:52:00,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-12 00:52:00,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-12 00:52:00,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:00,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 20 31) no Hoare annotation was computed. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2023-11-12 00:52:01,573 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point L25-3(line 25) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point L25-4(line 25) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L895 garLoopResultBuilder]: At program point L25-5(lines 25 29) the Hoare annotation is: (and (<= |ULTIMATE.start_foo_#res#1| 2147483647) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 0 (+ |ULTIMATE.start_foo_#res#1| 2147483648))) [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 28) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-11-12 00:52:01,574 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2023-11-12 00:52:01,575 INFO L895 garLoopResultBuilder]: At program point L22-5(lines 22 24) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_main_~#b~0#1.offset| 0)) (.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#b~0#1.base|))) (or (and (<= |ULTIMATE.start_foo_#res#1| 2147483647) (exists ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (and (or (and (exists ((|v_ULTIMATE.start_foo_~b#1.base_59| Int) (|v_ULTIMATE.start_foo_~i~0#1_80| Int) (|v_ULTIMATE.start_foo_#in~b#1.base_55| Int) (|v_ULTIMATE.start_foo_~b#1.offset_59| Int) (|v_ULTIMATE.start_foo_#in~n#1_55| Int) (|v_ULTIMATE.start_foo_#in~b#1.offset_55| Int) (|v_ULTIMATE.start_foo_~size#1_59| Int) (|v_ULTIMATE.start_foo_~n#1_56| Int) (|v_ULTIMATE.start_foo_#in~size#1_55| Int)) (and .cse0 .cse1 (<= |v_ULTIMATE.start_foo_~size#1_59| |ULTIMATE.start_foo_#res#1|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |v_ULTIMATE.start_foo_~b#1.base_59|) (<= 0 |v_ULTIMATE.start_foo_~i~0#1_80|) (<= 1 |v_ULTIMATE.start_foo_~size#1_59|) (= |v_ULTIMATE.start_foo_#in~b#1.offset_55| 0) (<= 2 |v_ULTIMATE.start_foo_#in~b#1.base_55|) (<= 1 |v_ULTIMATE.start_foo_~n#1_56|) (= |v_ULTIMATE.start_foo_~b#1.offset_59| 0) (<= 1 |v_ULTIMATE.start_foo_#in~size#1_55|) (<= 1 |v_ULTIMATE.start_main_~i~1#1_76|) (<= 1 |v_ULTIMATE.start_foo_#in~n#1_55|))) (= (+ |v_ULTIMATE.start_main_~i~1#1_76| 1) |ULTIMATE.start_main_~i~1#1|) (exists ((|v_#memory_int_60| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_60| |ULTIMATE.start_main_~#b~0#1.base| (store (select |v_#memory_int_60| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |v_ULTIMATE.start_main_~i~1#1_76| 4)) |ULTIMATE.start_foo_#res#1|))))) (and .cse0 (= |v_ULTIMATE.start_main_~i~1#1_76| 0) (exists ((|v_#valid_23| (Array Int Int))) (and (= (store |v_#valid_23| |ULTIMATE.start_main_~#b~0#1.base| 1) |#valid|) (= (select |v_#valid_23| 0) 0) (= (select |v_#valid_23| |ULTIMATE.start_main_~#b~0#1.base|) 0))) .cse1 (= |ULTIMATE.start_main_~i~1#1| 1) (exists ((|v_#memory_int_52| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_main_~#b~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_main_~#b~0#1.base|) 0 0)))) (exists ((|v_#length_10| (Array Int Int))) (= |#length| (store |v_#length_10| |ULTIMATE.start_main_~#b~0#1.base| 400))) (= |ULTIMATE.start_foo_#res#1| 0) .cse2)) (<= 0 (+ |v_ULTIMATE.start_main_~i~1#1_76| 2147483649)) (<= 0 (+ |ULTIMATE.start_main_~i~1#1| 2147483648)))) (<= |ULTIMATE.start_main_~i~1#1| 2147483646)) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~1#1| 0) (exists ((|v_#length_7| (Array Int Int))) (= (store |v_#length_7| |ULTIMATE.start_main_~#b~0#1.base| 400) |#length|)) .cse2 (exists ((|v_#valid_20| (Array Int Int))) (and (= (select |v_#valid_20| |ULTIMATE.start_main_~#b~0#1.base|) 0) (= |#valid| (store |v_#valid_20| |ULTIMATE.start_main_~#b~0#1.base| 1)) (= (select |v_#valid_20| 0) 0)))))) [2023-11-12 00:52:01,575 INFO L899 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2023-11-12 00:52:01,576 INFO L899 garLoopResultBuilder]: For program point L14-4(line 14) no Hoare annotation was computed. [2023-11-12 00:52:01,576 INFO L895 garLoopResultBuilder]: At program point L14-5(lines 14 16) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_foo_~i~0#1| 0)) (.cse1 (<= |ULTIMATE.start_foo_~size#1| 99)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~1#1|)) (.cse3 (<= |ULTIMATE.start_main_~i~1#1| 2147483645))) (or (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_foo_#in~b#1.base| |ULTIMATE.start_foo_~b#1.base|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (= |ULTIMATE.start_foo_#in~b#1.base| |ULTIMATE.start_main_~#b~0#1.base|) (= |ULTIMATE.start_foo_~size#1| 0) (= 0 |ULTIMATE.start_foo_~n#1|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_#in~size#1| 0) (exists ((|v_#length_7| (Array Int Int))) (= (store |v_#length_7| |ULTIMATE.start_main_~#b~0#1.base| 400) |#length|)) .cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#b~0#1.base|) (exists ((|v_#valid_20| (Array Int Int))) (and (= (select |v_#valid_20| |ULTIMATE.start_main_~#b~0#1.base|) 0) (= |#valid| (store |v_#valid_20| |ULTIMATE.start_main_~#b~0#1.base| 1)) (= (select |v_#valid_20| 0) 0))) (= |ULTIMATE.start_foo_#in~n#1| 0)) (and .cse1 .cse2 .cse0 .cse3) (and (<= |ULTIMATE.start_foo_~i~0#1| 2147483647) .cse1 .cse2 (<= 1 |ULTIMATE.start_foo_~i~0#1|) .cse3))) [2023-11-12 00:52:01,580 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:01,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:52:01,607 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated [2023-11-12 00:52:01,609 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,609 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,611 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated [2023-11-12 00:52:01,611 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,612 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,613 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,614 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,615 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,616 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,617 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,618 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:52:01 BoogieIcfgContainer [2023-11-12 00:52:01,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:52:01,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:52:01,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:52:01,620 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:52:01,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:44" (3/4) ... [2023-11-12 00:52:01,623 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:52:01,631 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-12 00:52:01,631 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-12 00:52:01,631 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-12 00:52:01,632 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:52:01,668 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result <= 2147483647) && (i <= 2147483646)) || (i == 0)) [2023-11-12 00:52:01,668 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result <= 2147483647) && (0 <= i)) && (0 <= (\result + 2147483648))) [2023-11-12 00:52:01,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((i == 0) && (size == 0)) && (0 == n)) && (\old(size) == 0)) && (i == 0)) && (\old(n) == 0)) || ((((size <= 99) && (1 <= i)) && (i == 0)) && (i <= 2147483645))) || (((((i <= 2147483647) && (size <= 99)) && (1 <= i)) && (1 <= i)) && (i <= 2147483645))) [2023-11-12 00:52:01,683 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result <= 2147483647) && (i <= 2147483646)) || (i == 0)) [2023-11-12 00:52:01,684 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result <= 2147483647) && (0 <= i)) && (0 <= (\result + 2147483648))) [2023-11-12 00:52:01,684 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((i == 0) && (size == 0)) && (0 == n)) && (\old(size) == 0)) && (i == 0)) && (\old(n) == 0)) || ((((size <= 99) && (1 <= i)) && (i == 0)) && (i <= 2147483645))) || (((((i <= 2147483647) && (size <= 99)) && (1 <= i)) && (1 <= i)) && (i <= 2147483645))) [2023-11-12 00:52:01,732 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:52:01,733 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:52:01,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:52:01,734 INFO L158 Benchmark]: Toolchain (without parser) took 18185.86ms. Allocated memory was 136.3MB in the beginning and 379.6MB in the end (delta: 243.3MB). Free memory was 91.8MB in the beginning and 151.3MB in the end (delta: -59.5MB). Peak memory consumption was 185.3MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,734 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:01,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.91ms. Allocated memory is still 136.3MB. Free memory was 91.8MB in the beginning and 81.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.32ms. Allocated memory is still 136.3MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,736 INFO L158 Benchmark]: Boogie Preprocessor took 24.53ms. Allocated memory is still 136.3MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:01,737 INFO L158 Benchmark]: RCFGBuilder took 365.84ms. Allocated memory is still 136.3MB. Free memory was 78.8MB in the beginning and 66.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,738 INFO L158 Benchmark]: TraceAbstraction took 17413.04ms. Allocated memory was 136.3MB in the beginning and 379.6MB in the end (delta: 243.3MB). Free memory was 65.7MB in the beginning and 155.5MB in the end (delta: -89.8MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,738 INFO L158 Benchmark]: Witness Printer took 113.49ms. Allocated memory is still 379.6MB. Free memory was 155.5MB in the beginning and 151.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:52:01,746 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.29ms. Allocated memory is still 136.3MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.91ms. Allocated memory is still 136.3MB. Free memory was 91.8MB in the beginning and 81.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.32ms. Allocated memory is still 136.3MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.53ms. Allocated memory is still 136.3MB. Free memory was 80.4MB in the beginning and 78.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.84ms. Allocated memory is still 136.3MB. Free memory was 78.8MB in the beginning and 66.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17413.04ms. Allocated memory was 136.3MB in the beginning and 379.6MB in the end (delta: 243.3MB). Free memory was 65.7MB in the beginning and 155.5MB in the end (delta: -89.8MB). Peak memory consumption was 153.8MB. Max. memory is 16.1GB. * Witness Printer took 113.49ms. Allocated memory is still 379.6MB. Free memory was 155.5MB in the beginning and 151.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 460 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 87 mSDtfsCounter, 460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 163 SyntacticMatches, 13 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=9, InterpolantAutomatonStates: 75, 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, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 16 NumberOfFragments, 294 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2155 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 663 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 222 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 18 NumberOfNonLiveVariables, 617 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 140/216 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: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 27, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 84, TOOLS_POST_TIME: 1.4s, 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: 78, TOOLS_QUANTIFIERELIM_TIME: 1.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 136, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 15, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 12, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 27, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 1.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 12, 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: 455, DAG_COMPRESSION_RETAINED_NODES: 82, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2023-11-12 00:52:01,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated [2023-11-12 00:52:01,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,782 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~1#1_76 : int :: (((((exists v_ULTIMATE.start_foo_~b#1.base_59 : int, v_ULTIMATE.start_foo_~i~0#1_80 : int, v_ULTIMATE.start_foo_#in~b#1.base_55 : int, v_ULTIMATE.start_foo_~b#1.offset_59 : int, v_ULTIMATE.start_foo_#in~n#1_55 : int, v_ULTIMATE.start_foo_#in~b#1.offset_55 : int, v_ULTIMATE.start_foo_~size#1_59 : int, v_ULTIMATE.start_foo_~n#1_56 : int, v_ULTIMATE.start_foo_#in~size#1_55 : int :: ((((((((((((1 <= #StackHeapBarrier && ~#b~0!offset == 0) && v_ULTIMATE.start_foo_~size#1_59 <= #res) && 2 <= ~#b~0!base) && 2 <= v_ULTIMATE.start_foo_~b#1.base_59) && 0 <= v_ULTIMATE.start_foo_~i~0#1_80) && 1 <= v_ULTIMATE.start_foo_~size#1_59) && v_ULTIMATE.start_foo_#in~b#1.offset_55 == 0) && 2 <= v_ULTIMATE.start_foo_#in~b#1.base_55) && 1 <= v_ULTIMATE.start_foo_~n#1_56) && v_ULTIMATE.start_foo_~b#1.offset_59 == 0) && 1 <= v_ULTIMATE.start_foo_#in~size#1_55) && 1 <= v_ULTIMATE.start_main_~i~1#1_76) && 1 <= v_ULTIMATE.start_foo_#in~n#1_55) && v_ULTIMATE.start_main_~i~1#1_76 + 1 == ~i~1) && (exists v_#memory_int_60 : [int,int]int :: #memory_int == v_#memory_int_60[~#b~0!base := v_#memory_int_60[~#b~0!base][~#b~0!offset + v_ULTIMATE.start_main_~i~1#1_76 * 4 := #res]])) || ((((((((1 <= #StackHeapBarrier && v_ULTIMATE.start_main_~i~1#1_76 == 0) && (exists v_#valid_23 : [int]int :: (v_#valid_23[~#b~0!base := 1] == #valid && v_#valid_23[0] == 0) && v_#valid_23[~#b~0!base] == 0)) && ~#b~0!offset == 0) && ~i~1 == 1) && (exists v_#memory_int_52 : [int,int]int :: #memory_int == v_#memory_int_52[~#b~0!base := v_#memory_int_52[~#b~0!base][0 := 0]])) && (exists v_#length_10 : [int]int :: #length == v_#length_10[~#b~0!base := 400])) && #res == 0) && #StackHeapBarrier + 1 <= ~#b~0!base)) && 0 <= v_ULTIMATE.start_main_~i~1#1_76 + 2147483649) && 0 <= ~i~1 + 2147483648) could not be translated [2023-11-12 00:52:01,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,784 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated Derived loop invariant: (((\result <= 2147483647) && (i <= 2147483646)) || (i == 0)) - InvariantResult [Line: 14]: Loop Invariant [2023-11-12 00:52:01,785 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,785 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,786 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,787 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,787 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated [2023-11-12 00:52:01,788 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,788 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,789 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,789 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~b!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,789 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~b!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-12 00:52:01,790 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: v_#length_7[~#b~0!base := 400] == #length) could not be translated [2023-11-12 00:52:01,790 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_20 : [int]int :: (v_#valid_20[~#b~0!base] == 0 && #valid == v_#valid_20[~#b~0!base := 1]) && v_#valid_20[0] == 0) could not be translated Derived loop invariant: ((((((((i == 0) && (size == 0)) && (0 == n)) && (\old(size) == 0)) && (i == 0)) && (\old(n) == 0)) || ((((size <= 99) && (1 <= i)) && (i == 0)) && (i <= 2147483645))) || (((((i <= 2147483647) && (size <= 99)) && (1 <= i)) && (1 <= i)) && (i <= 2147483645))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((\result <= 2147483647) && (0 <= i)) && (0 <= (\result + 2147483648))) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:52:01,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b7612a9-e12f-4714-aeca-3ca571c3f9f0/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