./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b 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_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:33,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:33,730 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 23:10:33,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:33,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:33,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:33,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:33,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:33,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:33,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:33,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:33,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:33,796 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:33,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:33,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:10:33,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:10:33,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:33,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:10:33,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:33,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:10:33,801 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:10:33,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:10:33,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:10:33,804 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:33,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:33,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:33,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:33,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:33,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:33,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:33,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:10:33,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:10:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:10:33,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:33,810 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:10:33,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:33,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:33,811 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:33,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/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_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ef6a70edb4426b11650a0154f4234f5ac775ab47d29a5a4fff3db3968295222 [2023-11-06 23:10:34,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:34,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:34,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:34,171 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:34,172 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:34,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2023-11-06 23:10:37,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:37,603 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:37,607 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/sv-benchmarks/c/termination-memory-alloca/b.11-alloca.i [2023-11-06 23:10:37,635 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/data/41dad2e0f/08e9570497f743f48ba79b702a4aee05/FLAG4a5ed5338 [2023-11-06 23:10:37,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/data/41dad2e0f/08e9570497f743f48ba79b702a4aee05 [2023-11-06 23:10:37,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:37,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:37,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:37,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:37,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:37,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346144a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:37, skipping insertion in model container [2023-11-06 23:10:37,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:37" (1/1) ... [2023-11-06 23:10:37,738 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:38,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:38,100 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:38,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:38,177 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:38,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38 WrapperNode [2023-11-06 23:10:38,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:38,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:38,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:38,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:38,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,236 INFO L138 Inliner]: procedures = 111, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-11-06 23:10:38,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:38,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:38,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:38,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:38,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:38,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:38,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:38,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:38,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (1/1) ... [2023-11-06 23:10:38,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:38,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:38,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:38,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:10:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:10:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:10:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:10:38,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:38,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:38,528 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:38,531 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:38,778 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:38,793 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:38,793 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:10:38,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38 BoogieIcfgContainer [2023-11-06 23:10:38,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:38,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:38,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:38,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:38,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:37" (1/3) ... [2023-11-06 23:10:38,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f628f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:38, skipping insertion in model container [2023-11-06 23:10:38,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:38" (2/3) ... [2023-11-06 23:10:38,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f628f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:38, skipping insertion in model container [2023-11-06 23:10:38,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38" (3/3) ... [2023-11-06 23:10:38,805 INFO L112 eAbstractionObserver]: Analyzing ICFG b.11-alloca.i [2023-11-06 23:10:38,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:38,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 23:10:38,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:38,920 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63391e6f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:38,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-06 23:10:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 41 states have internal predecessors, (49), 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-06 23:10:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 23:10:38,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:38,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:38,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash 28695781, now seen corresponding path program 1 times [2023-11-06 23:10:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625811021] [2023-11-06 23:10:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,900 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-06 23:10:39,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:39,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625811021] [2023-11-06 23:10:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625811021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:39,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315645701] [2023-11-06 23:10:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:39,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:39,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:39,955 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 41 states have internal predecessors, (49), 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 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,078 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2023-11-06 23:10:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:40,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 23:10:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,090 INFO L225 Difference]: With dead ends: 62 [2023-11-06 23:10:40,090 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 23:10:40,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:40,097 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 78 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 23:10:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2023-11-06 23:10:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.68) internal successors, (42), 35 states have internal predecessors, (42), 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-06 23:10:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-11-06 23:10:40,133 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 5 [2023-11-06 23:10:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,133 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-11-06 23:10:40,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-11-06 23:10:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 23:10:40,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:10:40,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:40,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 889569255, now seen corresponding path program 1 times [2023-11-06 23:10:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428624251] [2023-11-06 23:10:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,279 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-06 23:10:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428624251] [2023-11-06 23:10:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428624251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:40,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341741438] [2023-11-06 23:10:40,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:40,284 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.0) 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-06 23:10:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,342 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2023-11-06 23:10:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 23:10:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,344 INFO L225 Difference]: With dead ends: 51 [2023-11-06 23:10:40,345 INFO L226 Difference]: Without dead ends: 50 [2023-11-06 23:10:40,345 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-06 23:10:40,347 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 38 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-06 23:10:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-11-06 23:10:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.64) internal successors, (41), 34 states have internal predecessors, (41), 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-06 23:10:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-06 23:10:40,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2023-11-06 23:10:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,355 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-06 23:10:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-06 23:10:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-06 23:10:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 23:10:40,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:40,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:40,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:40,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 183292466, now seen corresponding path program 1 times [2023-11-06 23:10:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036302109] [2023-11-06 23:10:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,456 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-06 23:10:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036302109] [2023-11-06 23:10:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036302109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215571582] [2023-11-06 23:10:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,459 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 23:10:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,559 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-06 23:10:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:40,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 23:10:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,562 INFO L225 Difference]: With dead ends: 72 [2023-11-06 23:10:40,562 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 23:10:40,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:40,564 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 104 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 23:10:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2023-11-06 23:10:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 38 states have internal predecessors, (47), 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-06 23:10:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2023-11-06 23:10:40,572 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 8 [2023-11-06 23:10:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,572 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2023-11-06 23:10:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-06 23:10:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2023-11-06 23:10:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:10:40,573 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:40,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:40,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:40,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1387049590, now seen corresponding path program 1 times [2023-11-06 23:10:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855710820] [2023-11-06 23:10:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,649 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-06 23:10:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855710820] [2023-11-06 23:10:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855710820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408168809] [2023-11-06 23:10:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:40,657 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,699 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-11-06 23:10:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:10:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,701 INFO L225 Difference]: With dead ends: 86 [2023-11-06 23:10:40,701 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 23:10:40,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,704 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 101 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 23:10:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-11-06 23:10:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 38 states have internal predecessors, (46), 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-06 23:10:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-11-06 23:10:40,711 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 9 [2023-11-06 23:10:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,711 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-11-06 23:10:40,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-11-06 23:10:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 23:10:40,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:40,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:40,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:40,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1387099210, now seen corresponding path program 1 times [2023-11-06 23:10:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120901553] [2023-11-06 23:10:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,956 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-06 23:10:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120901553] [2023-11-06 23:10:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120901553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072198060] [2023-11-06 23:10:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:40,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,961 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:41,043 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-11-06 23:10:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 23:10:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:41,045 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:10:41,045 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 23:10:41,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:41,047 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 43 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:41,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 105 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 23:10:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2023-11-06 23:10:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 51 states have internal predecessors, (64), 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-06 23:10:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2023-11-06 23:10:41,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 9 [2023-11-06 23:10:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:41,056 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2023-11-06 23:10:41,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2023-11-06 23:10:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 23:10:41,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:41,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:41,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:41,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:41,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1159982034, now seen corresponding path program 1 times [2023-11-06 23:10:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:41,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109716982] [2023-11-06 23:10:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,175 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-06 23:10:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109716982] [2023-11-06 23:10:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109716982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239335742] [2023-11-06 23:10:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:41,179 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:41,282 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2023-11-06 23:10:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 23:10:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:41,288 INFO L225 Difference]: With dead ends: 125 [2023-11-06 23:10:41,289 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 23:10:41,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:41,293 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 57 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 23:10:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 44. [2023-11-06 23:10:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 43 states have internal predecessors, (52), 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-06 23:10:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2023-11-06 23:10:41,317 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 10 [2023-11-06 23:10:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:41,318 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2023-11-06 23:10:41,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2023-11-06 23:10:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:10:41,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:41,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:10:41,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:41,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1568206898, now seen corresponding path program 1 times [2023-11-06 23:10:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197027830] [2023-11-06 23:10:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,407 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-06 23:10:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197027830] [2023-11-06 23:10:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197027830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836918120] [2023-11-06 23:10:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:41,411 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 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-06 23:10:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:41,462 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-11-06 23:10:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 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-06 23:10:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:41,464 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:10:41,464 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 23:10:41,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:41,469 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:41,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 23:10:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 23:10:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 42 states have internal predecessors, (47), 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-06 23:10:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-06 23:10:41,488 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 11 [2023-11-06 23:10:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-06 23:10:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-06 23:10:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-06 23:10:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:10:41,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:41,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:41,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:41,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1599754246, now seen corresponding path program 1 times [2023-11-06 23:10:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:41,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237215500] [2023-11-06 23:10:41,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,819 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-06 23:10:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237215500] [2023-11-06 23:10:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237215500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865059732] [2023-11-06 23:10:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:41,823 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-06 23:10:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,047 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-11-06 23:10:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:10:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-06 23:10:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,049 INFO L225 Difference]: With dead ends: 97 [2023-11-06 23:10:42,049 INFO L226 Difference]: Without dead ends: 96 [2023-11-06 23:10:42,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:10:42,051 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 106 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 116 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-06 23:10:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 50. [2023-11-06 23:10:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 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-06 23:10:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-11-06 23:10:42,063 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2023-11-06 23:10:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,063 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-11-06 23:10:42,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-06 23:10:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-11-06 23:10:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 23:10:42,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:10:42,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:42,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1947225999, now seen corresponding path program 1 times [2023-11-06 23:10:42,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033698538] [2023-11-06 23:10:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:42,251 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-06 23:10:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033698538] [2023-11-06 23:10:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033698538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:42,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17219013] [2023-11-06 23:10:42,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:42,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:42,255 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-06 23:10:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,443 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-06 23:10:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:10:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 23:10:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,445 INFO L225 Difference]: With dead ends: 71 [2023-11-06 23:10:42,445 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 23:10:42,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:10:42,450 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 87 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 23:10:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2023-11-06 23:10:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 53 states have internal predecessors, (59), 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-06 23:10:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-06 23:10:42,463 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2023-11-06 23:10:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,464 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-06 23:10:42,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-06 23:10:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-06 23:10:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 23:10:42,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:10:42,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:42,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1694214290, now seen corresponding path program 1 times [2023-11-06 23:10:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39322996] [2023-11-06 23:10:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:42,647 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-06 23:10:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:42,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39322996] [2023-11-06 23:10:42,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39322996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:42,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:42,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509977450] [2023-11-06 23:10:42,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:42,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:42,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:42,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:42,650 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-06 23:10:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,884 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-11-06 23:10:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:42,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 23:10:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,885 INFO L225 Difference]: With dead ends: 56 [2023-11-06 23:10:42,889 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 23:10:42,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:10:42,890 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 23:10:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-11-06 23:10:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.288888888888889) internal successors, (58), 53 states have internal predecessors, (58), 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-06 23:10:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-06 23:10:42,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 13 [2023-11-06 23:10:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,899 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-06 23:10:42,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-06 23:10:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-06 23:10:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 23:10:42,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:10:42,901 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:42,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash -981035365, now seen corresponding path program 1 times [2023-11-06 23:10:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511517607] [2023-11-06 23:10:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,131 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-06 23:10:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511517607] [2023-11-06 23:10:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511517607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395868538] [2023-11-06 23:10:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:43,134 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-06 23:10:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:43,263 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2023-11-06 23:10:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:43,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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 14 [2023-11-06 23:10:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:43,265 INFO L225 Difference]: With dead ends: 69 [2023-11-06 23:10:43,265 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 23:10:43,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:10:43,266 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 70 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:43,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 104 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 23:10:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2023-11-06 23:10:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 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-06 23:10:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-11-06 23:10:43,276 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2023-11-06 23:10:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,276 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-11-06 23:10:43,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 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-06 23:10:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-11-06 23:10:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 23:10:43,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:43,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:43,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1981516964, now seen corresponding path program 1 times [2023-11-06 23:10:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775220704] [2023-11-06 23:10:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,346 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-06 23:10:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775220704] [2023-11-06 23:10:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775220704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604993652] [2023-11-06 23:10:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:43,349 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:43,401 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-11-06 23:10:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 23:10:43,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:43,402 INFO L225 Difference]: With dead ends: 68 [2023-11-06 23:10:43,402 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 23:10:43,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:43,403 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:43,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 23:10:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2023-11-06 23:10:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 55 states have internal predecessors, (61), 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-06 23:10:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-11-06 23:10:43,407 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 15 [2023-11-06 23:10:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,407 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-11-06 23:10:43,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-11-06 23:10:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:10:43,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:43,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:43,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1297483828, now seen corresponding path program 1 times [2023-11-06 23:10:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446774105] [2023-11-06 23:10:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,596 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-06 23:10:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446774105] [2023-11-06 23:10:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446774105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422704318] [2023-11-06 23:10:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:43,599 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-06 23:10:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:43,632 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-11-06 23:10:43,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-06 23:10:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:43,633 INFO L225 Difference]: With dead ends: 56 [2023-11-06 23:10:43,633 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 23:10:43,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:43,635 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:43,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 23:10:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 23:10:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.25) internal successors, (60), 54 states have internal predecessors, (60), 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-06 23:10:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-11-06 23:10:43,638 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 16 [2023-11-06 23:10:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,638 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-11-06 23:10:43,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-06 23:10:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-11-06 23:10:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:10:43,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:43,640 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:43,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1297490010, now seen corresponding path program 1 times [2023-11-06 23:10:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836296993] [2023-11-06 23:10:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,802 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-06 23:10:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836296993] [2023-11-06 23:10:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836296993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238068659] [2023-11-06 23:10:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:10:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:10:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:43,805 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-06 23:10:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:43,974 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-11-06 23:10:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:10:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-06 23:10:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:43,976 INFO L225 Difference]: With dead ends: 55 [2023-11-06 23:10:43,976 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 23:10:43,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:10:43,977 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:43,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 23:10:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-06 23:10:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 53 states have internal predecessors, (59), 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-06 23:10:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-06 23:10:43,981 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2023-11-06 23:10:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,982 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-06 23:10:43,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-06 23:10:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-06 23:10:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:10:43,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:10:43,983 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:43,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1297489818, now seen corresponding path program 1 times [2023-11-06 23:10:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420533548] [2023-11-06 23:10:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:44,093 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-06 23:10:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420533548] [2023-11-06 23:10:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420533548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634620869] [2023-11-06 23:10:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:44,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:44,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:44,096 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-06 23:10:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,145 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-06 23:10:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:44,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-06 23:10:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,146 INFO L225 Difference]: With dead ends: 63 [2023-11-06 23:10:44,147 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 23:10:44,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:44,149 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 53 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 23:10:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2023-11-06 23:10:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.24) internal successors, (62), 55 states have internal predecessors, (62), 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-06 23:10:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2023-11-06 23:10:44,153 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 16 [2023-11-06 23:10:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,154 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2023-11-06 23:10:44,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-06 23:10:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2023-11-06 23:10:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 23:10:44,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:44,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:44,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:10:44,156 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:44,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1227971096, now seen corresponding path program 1 times [2023-11-06 23:10:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027763888] [2023-11-06 23:10:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:44,385 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-06 23:10:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:44,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027763888] [2023-11-06 23:10:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027763888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:44,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537489935] [2023-11-06 23:10:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:44,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:44,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:44,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:44,387 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-06 23:10:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,608 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2023-11-06 23:10:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:10:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2023-11-06 23:10:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,610 INFO L225 Difference]: With dead ends: 114 [2023-11-06 23:10:44,610 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 23:10:44,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:10:44,611 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 45 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 197 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 23:10:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2023-11-06 23:10:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 53 states have internal predecessors, (59), 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-06 23:10:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-06 23:10:44,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 17 [2023-11-06 23:10:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,615 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-06 23:10:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-06 23:10:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-06 23:10:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 23:10:44,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:44,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:44,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:10:44,617 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:44,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1567484749, now seen corresponding path program 1 times [2023-11-06 23:10:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910963404] [2023-11-06 23:10:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:44,715 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-06 23:10:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910963404] [2023-11-06 23:10:44,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910963404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:44,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:44,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643820407] [2023-11-06 23:10:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:44,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:44,721 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-06 23:10:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,866 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2023-11-06 23:10:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:10:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2023-11-06 23:10:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,869 INFO L225 Difference]: With dead ends: 81 [2023-11-06 23:10:44,869 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 23:10:44,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:10:44,870 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 100 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 23:10:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2023-11-06 23:10:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.196969696969697) internal successors, (79), 70 states have internal predecessors, (79), 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-06 23:10:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-11-06 23:10:44,875 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2023-11-06 23:10:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,875 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-11-06 23:10:44,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-06 23:10:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-11-06 23:10:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 23:10:44,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:44,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:44,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:10:44,876 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:44,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1567478791, now seen corresponding path program 1 times [2023-11-06 23:10:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323054497] [2023-11-06 23:10:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,065 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-06 23:10:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323054497] [2023-11-06 23:10:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323054497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58394706] [2023-11-06 23:10:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:45,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:45,068 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-06 23:10:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:45,471 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-11-06 23:10:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:10:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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 17 [2023-11-06 23:10:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:45,472 INFO L225 Difference]: With dead ends: 110 [2023-11-06 23:10:45,472 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 23:10:45,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2023-11-06 23:10:45,474 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 86 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:45,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 149 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 23:10:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2023-11-06 23:10:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 87 states have internal predecessors, (100), 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-06 23:10:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2023-11-06 23:10:45,478 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 17 [2023-11-06 23:10:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:45,479 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2023-11-06 23:10:45,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 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-06 23:10:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2023-11-06 23:10:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 23:10:45,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:45,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:10:45,480 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:45,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -587595610, now seen corresponding path program 1 times [2023-11-06 23:10:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:45,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152058999] [2023-11-06 23:10:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:45,728 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-06 23:10:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152058999] [2023-11-06 23:10:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152058999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 23:10:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942569001] [2023-11-06 23:10:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:10:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:10:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:10:45,731 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:46,019 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2023-11-06 23:10:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:10:46,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 23:10:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:46,021 INFO L225 Difference]: With dead ends: 175 [2023-11-06 23:10:46,021 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 23:10:46,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:10:46,022 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 79 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:46,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 180 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 23:10:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-11-06 23:10:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 81 states have (on average 1.1604938271604939) internal successors, (94), 83 states have internal predecessors, (94), 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-06 23:10:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2023-11-06 23:10:46,027 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 18 [2023-11-06 23:10:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2023-11-06 23:10:46,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2023-11-06 23:10:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:10:46,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:46,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:46,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:10:46,029 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:46,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1035588671, now seen corresponding path program 1 times [2023-11-06 23:10:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683147647] [2023-11-06 23:10:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:46,190 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-06 23:10:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683147647] [2023-11-06 23:10:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683147647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640658948] [2023-11-06 23:10:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:46,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:46,192 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:46,258 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2023-11-06 23:10:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 23:10:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:46,259 INFO L225 Difference]: With dead ends: 84 [2023-11-06 23:10:46,259 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 23:10:46,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:46,260 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:46,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 49 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 23:10:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-11-06 23:10:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 63 states have internal predecessors, (71), 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-06 23:10:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2023-11-06 23:10:46,264 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 19 [2023-11-06 23:10:46,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:46,264 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2023-11-06 23:10:46,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2023-11-06 23:10:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 23:10:46,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:46,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:46,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:10:46,266 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:46,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1066462104, now seen corresponding path program 1 times [2023-11-06 23:10:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695325965] [2023-11-06 23:10:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695325965] [2023-11-06 23:10:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695325965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350656781] [2023-11-06 23:10:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:46,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:46,521 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-06 23:10:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:46,889 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-11-06 23:10:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:10:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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 23 [2023-11-06 23:10:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:46,890 INFO L225 Difference]: With dead ends: 98 [2023-11-06 23:10:46,890 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 23:10:46,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:10:46,891 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:46,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 167 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 23:10:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2023-11-06 23:10:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-11-06 23:10:46,895 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 23 [2023-11-06 23:10:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:46,896 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-11-06 23:10:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-06 23:10:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-11-06 23:10:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:10:46,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:46,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:46,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:10:46,900 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:46,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash 123800159, now seen corresponding path program 1 times [2023-11-06 23:10:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:46,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414386561] [2023-11-06 23:10:46,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:46,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:47,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:47,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414386561] [2023-11-06 23:10:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414386561] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256921039] [2023-11-06 23:10:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:47,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:47,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:10:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:47,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 23:10:47,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:10:47,415 INFO L322 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2023-11-06 23:10:47,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 89 [2023-11-06 23:10:47,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 23:10:47,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-06 23:10:47,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:10:47,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 23:10:47,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:10:47,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2023-11-06 23:10:47,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-06 23:10:49,527 INFO L322 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-11-06 23:10:49,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 402 treesize of output 348 [2023-11-06 23:10:49,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2023-11-06 23:10:49,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 23:10:49,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-06 23:10:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:49,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:10:49,822 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 9223372039002259456))) is different from false [2023-11-06 23:10:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:50,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256921039] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:10:50,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:10:50,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2023-11-06 23:10:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923219352] [2023-11-06 23:10:50,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:10:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 23:10:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 23:10:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=325, Unknown=15, NotChecked=38, Total=462 [2023-11-06 23:10:50,308 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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-06 23:10:50,821 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (not .cse1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (or (and (<= .cse0 2147483647) .cse1) (and (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse3) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= .cse2 2147483647) (= .cse2 .cse0)))) .cse4) (exists ((|ULTIMATE.start_test_fun_#t~malloc4#1.base| Int)) (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_test_fun_#t~malloc4#1.base| (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (select .cse6 0))) (and (<= .cse5 2147483647) (= (store .cse3 0 .cse5) .cse6) (= .cse7 v_DerPreprocessor_1) (= .cse7 .cse3) (= .cse5 .cse0))))))))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) .cse4 (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| (select .cse3 0)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem15#1| .cse0)))) is different from true [2023-11-06 23:10:54,371 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0)) (.cse9 (select .cse3 0))) (and (or (and (<= .cse0 2147483647) .cse1) (and (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse3) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= .cse2 2147483647) (= .cse2 .cse0)))) .cse4) (exists ((|ULTIMATE.start_test_fun_#t~malloc4#1.base| Int)) (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_test_fun_#t~malloc4#1.base| (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (select .cse6 0))) (and (<= .cse5 2147483647) (= (store .cse3 0 .cse5) .cse6) (= .cse7 v_DerPreprocessor_1) (= .cse7 .cse3) (= .cse5 .cse0))))))))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_#t~mem21#1| .cse0) (<= .cse9 2147483646) .cse4 (<= 0 (+ 2147483646 .cse9)) (<= .cse9 .cse0) (= |c_ULTIMATE.start_test_fun_#t~mem20#1| .cse9) (<= 1 (+ .cse0 .cse9)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 23:10:54,566 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse5 (not .cse2)) (.cse10 (select .cse4 0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (or (< 0 (+ .cse0 1)) (not |c_ULTIMATE.start_test_fun_#t~short8#1|)) (or (and (<= .cse1 2147483647) .cse2) (and (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse4) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= .cse3 2147483647) (= .cse3 .cse1)))) .cse5) (exists ((|ULTIMATE.start_test_fun_#t~malloc4#1.base| Int)) (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_test_fun_#t~malloc4#1.base| (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse6 (select .cse7 0))) (and (<= .cse6 2147483647) (= (store .cse4 0 .cse6) .cse7) (= .cse8 v_DerPreprocessor_1) (= .cse8 .cse4) (= .cse6 .cse1))))))))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ 9223372039002259455 .cse0)) (<= .cse10 2147483646) .cse5 (<= 0 (+ 2147483646 .cse10)) (or (< 0 (+ .cse1 .cse10)) (not |c_ULTIMATE.start_test_fun_#t~short16#1|)) (<= 0 (+ |c_ULTIMATE.start_test_fun_#t~mem10#1| 2147483646)) (<= |c_ULTIMATE.start_test_fun_#t~mem14#1| .cse10) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem15#1| .cse1)))) is different from true [2023-11-06 23:10:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:55,329 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2023-11-06 23:10:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-06 23:10:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-06 23:10:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:55,335 INFO L225 Difference]: With dead ends: 311 [2023-11-06 23:10:55,335 INFO L226 Difference]: Without dead ends: 310 [2023-11-06 23:10:55,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=805, Invalid=2590, Unknown=161, NotChecked=476, Total=4032 [2023-11-06 23:10:55,338 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 403 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 31 mSolverCounterUnsat, 84 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 84 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:55,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 342 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 611 Invalid, 84 Unknown, 300 Unchecked, 1.6s Time] [2023-11-06 23:10:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-11-06 23:10:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2023-11-06 23:10:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 193 states have (on average 1.16580310880829) internal successors, (225), 194 states have internal predecessors, (225), 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-06 23:10:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2023-11-06 23:10:55,349 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 24 [2023-11-06 23:10:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:55,350 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2023-11-06 23:10:55,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 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-06 23:10:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2023-11-06 23:10:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:10:55,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:55,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:55,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:10:55,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 23:10:55,557 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:55,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1690745957, now seen corresponding path program 1 times [2023-11-06 23:10:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426729101] [2023-11-06 23:10:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426729101] [2023-11-06 23:10:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426729101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:10:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677455979] [2023-11-06 23:10:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:55,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:10:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:10:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:10:55,835 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:56,280 INFO L93 Difference]: Finished difference Result 269 states and 306 transitions. [2023-11-06 23:10:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:10:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-06 23:10:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:56,283 INFO L225 Difference]: With dead ends: 269 [2023-11-06 23:10:56,283 INFO L226 Difference]: Without dead ends: 268 [2023-11-06 23:10:56,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2023-11-06 23:10:56,284 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:56,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-06 23:10:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 186. [2023-11-06 23:10:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 1.1576086956521738) internal successors, (213), 185 states have internal predecessors, (213), 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-06 23:10:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 213 transitions. [2023-11-06 23:10:56,295 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 213 transitions. Word has length 24 [2023-11-06 23:10:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:56,295 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 213 transitions. [2023-11-06 23:10:56,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 213 transitions. [2023-11-06 23:10:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 23:10:56,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:56,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:10:56,297 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:10:56,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -494367800, now seen corresponding path program 1 times [2023-11-06 23:10:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265828530] [2023-11-06 23:10:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265828530] [2023-11-06 23:10:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265828530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:10:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630200288] [2023-11-06 23:10:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:10:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:56,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:10:56,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:10:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:56,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 23:10:56,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:57,053 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:10:57,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2023-11-06 23:10:57,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-11-06 23:10:57,298 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2023-11-06 23:10:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:57,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:10:57,722 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-06 23:10:57,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2023-11-06 23:10:57,733 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-06 23:10:57,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2023-11-06 23:10:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630200288] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:10:57,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:10:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-11-06 23:10:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188448379] [2023-11-06 23:10:57,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:10:57,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 23:10:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 23:10:57,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-11-06 23:10:57,768 INFO L87 Difference]: Start difference. First operand 186 states and 213 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 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-06 23:11:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:01,107 INFO L93 Difference]: Finished difference Result 389 states and 432 transitions. [2023-11-06 23:11:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-06 23:11:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 23:11:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:01,111 INFO L225 Difference]: With dead ends: 389 [2023-11-06 23:11:01,111 INFO L226 Difference]: Without dead ends: 388 [2023-11-06 23:11:01,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1409, Invalid=4597, Unknown=0, NotChecked=0, Total=6006 [2023-11-06 23:11:01,115 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 370 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 320 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:11:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-06 23:11:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 218. [2023-11-06 23:11:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.1666666666666667) internal successors, (252), 217 states have internal predecessors, (252), 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-06 23:11:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2023-11-06 23:11:01,131 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 25 [2023-11-06 23:11:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:01,131 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2023-11-06 23:11:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 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-06 23:11:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2023-11-06 23:11:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 23:11:01,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:01,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:01,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:01,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 23:11:01,338 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:11:01,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash -154397489, now seen corresponding path program 1 times [2023-11-06 23:11:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053968409] [2023-11-06 23:11:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053968409] [2023-11-06 23:11:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053968409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:11:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367242081] [2023-11-06 23:11:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:01,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:11:01,669 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:11:01,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:11:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:01,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 23:11:01,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:01,959 INFO L322 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-11-06 23:11:01,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 38 [2023-11-06 23:11:02,174 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:11:02,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-11-06 23:11:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:02,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:11:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367242081] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 23:11:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:11:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 10] total 27 [2023-11-06 23:11:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857501755] [2023-11-06 23:11:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2023-11-06 23:11:02,532 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:03,154 INFO L93 Difference]: Finished difference Result 280 states and 320 transitions. [2023-11-06 23:11:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 23:11:03,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 23:11:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:03,160 INFO L225 Difference]: With dead ends: 280 [2023-11-06 23:11:03,161 INFO L226 Difference]: Without dead ends: 279 [2023-11-06 23:11:03,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2023-11-06 23:11:03,162 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 66 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:03,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 99 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:11:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-06 23:11:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2023-11-06 23:11:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 232 states have (on average 1.1422413793103448) internal successors, (265), 233 states have internal predecessors, (265), 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-06 23:11:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2023-11-06 23:11:03,187 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 26 [2023-11-06 23:11:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:03,187 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2023-11-06 23:11:03,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2023-11-06 23:11:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 23:11:03,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:03,188 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:03,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:03,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:03,394 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:11:03,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1853006507, now seen corresponding path program 1 times [2023-11-06 23:11:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259750753] [2023-11-06 23:11:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:03,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:03,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259750753] [2023-11-06 23:11:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259750753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:11:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583714190] [2023-11-06 23:11:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:11:03,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:11:03,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:11:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:03,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 23:11:03,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:04,119 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-06 23:11:04,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2023-11-06 23:11:04,318 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:11:04,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 25 [2023-11-06 23:11:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:04,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:11:04,533 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-06 23:11:04,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-06 23:11:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583714190] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 23:11:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:11:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 8] total 21 [2023-11-06 23:11:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861606039] [2023-11-06 23:11:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:04,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:04,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:04,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:11:04,538 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:05,742 INFO L93 Difference]: Finished difference Result 535 states and 595 transitions. [2023-11-06 23:11:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 23:11:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 23:11:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:05,746 INFO L225 Difference]: With dead ends: 535 [2023-11-06 23:11:05,746 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 23:11:05,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=370, Invalid=1886, Unknown=0, NotChecked=0, Total=2256 [2023-11-06 23:11:05,748 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 275 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:05,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 118 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:11:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 23:11:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 185. [2023-11-06 23:11:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 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-06 23:11:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2023-11-06 23:11:05,766 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 26 [2023-11-06 23:11:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:05,766 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2023-11-06 23:11:05,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2023-11-06 23:11:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 23:11:05,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:05,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:05,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:05,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:05,974 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:11:05,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1240894671, now seen corresponding path program 1 times [2023-11-06 23:11:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635551571] [2023-11-06 23:11:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:11:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635551571] [2023-11-06 23:11:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635551571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:11:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:11:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:11:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724364307] [2023-11-06 23:11:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:11:06,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:11:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:06,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:11:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:11:06,280 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-06 23:11:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:06,590 INFO L93 Difference]: Finished difference Result 345 states and 388 transitions. [2023-11-06 23:11:06,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 23:11:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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 54 [2023-11-06 23:11:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:06,592 INFO L225 Difference]: With dead ends: 345 [2023-11-06 23:11:06,593 INFO L226 Difference]: Without dead ends: 221 [2023-11-06 23:11:06,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:11:06,596 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:06,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:11:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-06 23:11:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 160. [2023-11-06 23:11:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.1320754716981132) internal successors, (180), 159 states have internal predecessors, (180), 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-06 23:11:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2023-11-06 23:11:06,611 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 54 [2023-11-06 23:11:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:06,612 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2023-11-06 23:11:06,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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-06 23:11:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2023-11-06 23:11:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 23:11:06,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:06,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:06,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 23:11:06,614 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-11-06 23:11:06,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash 114469945, now seen corresponding path program 1 times [2023-11-06 23:11:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:11:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042574087] [2023-11-06 23:11:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:11:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 23:11:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:11:06,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042574087] [2023-11-06 23:11:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042574087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:11:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044957161] [2023-11-06 23:11:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:11:06,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:11:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:11:06,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:11:06,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:11:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:11:07,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 23:11:07,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:07,134 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 23:11:07,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2023-11-06 23:11:07,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-11-06 23:11:07,550 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 23:11:07,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 24 [2023-11-06 23:11:07,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-06 23:11:07,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 23:11:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:07,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:11:07,628 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 9223372039002259456))) is different from false [2023-11-06 23:11:08,205 INFO L322 Elim1Store]: treesize reduction 8, result has 27.3 percent of original size [2023-11-06 23:11:08,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 98 [2023-11-06 23:11:08,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-06 23:11:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 1 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-06 23:11:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044957161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:11:08,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:11:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 28 [2023-11-06 23:11:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369528553] [2023-11-06 23:11:08,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:11:08,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 23:11:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:11:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 23:11:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=4, NotChecked=52, Total=812 [2023-11-06 23:11:08,248 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand has 29 states, 28 states have (on average 5.214285714285714) internal successors, (146), 29 states have internal predecessors, (146), 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-06 23:11:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:09,432 INFO L93 Difference]: Finished difference Result 423 states and 470 transitions. [2023-11-06 23:11:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 23:11:09,436 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 5.214285714285714) internal successors, (146), 29 states have internal predecessors, (146), 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 54 [2023-11-06 23:11:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:09,437 INFO L225 Difference]: With dead ends: 423 [2023-11-06 23:11:09,437 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:11:09,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=875, Invalid=2317, Unknown=4, NotChecked=110, Total=3306 [2023-11-06 23:11:09,440 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 181 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:09,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 292 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 474 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2023-11-06 23:11:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:11:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:11:09,441 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-06 23:11:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:11:09,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2023-11-06 23:11:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:09,441 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:11:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 5.214285714285714) internal successors, (146), 29 states have internal predecessors, (146), 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-06 23:11:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:11:09,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:11:09,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2023-11-06 23:11:09,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2023-11-06 23:11:09,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2023-11-06 23:11:09,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2023-11-06 23:11:09,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2023-11-06 23:11:09,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2023-11-06 23:11:09,446 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2023-11-06 23:11:09,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:11:09,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 23:11:09,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:11:11,810 INFO L899 garLoopResultBuilder]: For program point L555-10(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-12(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-13(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-14(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-15(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-16(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-18(lines 555 565) no Hoare annotation was computed. [2023-11-06 23:11:11,811 INFO L899 garLoopResultBuilder]: For program point L555-20(lines 555 565) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point L560-1(line 560) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 564) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 568 570) the Hoare annotation is: true [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point L557(line 557) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point L557-1(line 557) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L895 garLoopResultBuilder]: At program point test_fun_returnLabel#1(lines 547 567) the Hoare annotation is: (< (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648) [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point L562(line 562) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point L562-1(line 562) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2023-11-06 23:11:11,813 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 563) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L895 garLoopResultBuilder]: At program point L559-2(lines 555 565) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0)) (.cse1 (select .cse7 0))) (let ((.cse3 (<= .cse1 2147483647)) (.cse12 (<= .cse5 2147483647)) (.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))) (or (and .cse0 (<= 0 (+ 2147483648 .cse1)) .cse2 .cse3 .cse4 (<= 0 (+ .cse5 2147483648)) (or (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse6 (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse7) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= .cse6 2147483647) (= .cse5 .cse6)))) (exists ((|ULTIMATE.start_test_fun_#t~malloc4#1.base| Int)) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |ULTIMATE.start_test_fun_#t~malloc4#1.base| (select |#memory_int| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)))) (let ((.cse10 (select .cse11 |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse8 (select .cse11 |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse9 (select .cse10 0))) (and (= v_DerPreprocessor_1 .cse8) (= (store .cse7 0 .cse9) .cse10) (= .cse8 .cse7) (= .cse5 .cse9) (<= .cse9 2147483647)))))) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc4#1.base|)))))) (and .cse12 .cse0 .cse2 (<= 0 (+ .cse5 2147483648 .cse1)) .cse3 .cse4 (<= 0 .cse1)) (and .cse12 .cse0 .cse2 (not (= (+ .cse5 1) .cse1)) .cse4 (<= (+ .cse1 1) 0) (<= 0 (+ 9223372039002259455 .cse1))))))) [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point L555-1(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point L555-2(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 557) no Hoare annotation was computed. [2023-11-06 23:11:11,814 INFO L899 garLoopResultBuilder]: For program point L555-3(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,815 INFO L899 garLoopResultBuilder]: For program point L555-5(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,815 INFO L899 garLoopResultBuilder]: For program point L555-6(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,815 INFO L899 garLoopResultBuilder]: For program point L555-8(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,815 INFO L899 garLoopResultBuilder]: For program point L555-9(line 555) no Hoare annotation was computed. [2023-11-06 23:11:11,818 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:11:11,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:11:11,836 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,837 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,837 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,838 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated [2023-11-06 23:11:11,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated [2023-11-06 23:11:11,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,839 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,840 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,841 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,842 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,843 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,846 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated [2023-11-06 23:11:11,847 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated [2023-11-06 23:11:11,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,848 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,849 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,849 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,849 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,849 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,849 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:11,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:11,850 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,851 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:11,852 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:11,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:11:11 BoogieIcfgContainer [2023-11-06 23:11:11,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:11:11,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:11:11,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:11:11,854 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:11:11,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:38" (3/4) ... [2023-11-06 23:11:11,857 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:11:11,866 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 23:11:11,867 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:11:11,867 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 23:11:11,868 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:11:11,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:11:11,960 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:11:11,960 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:11:11,961 INFO L158 Benchmark]: Toolchain (without parser) took 34300.67ms. Allocated memory was 140.5MB in the beginning and 264.2MB in the end (delta: 123.7MB). Free memory was 94.2MB in the beginning and 173.4MB in the end (delta: -79.3MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,961 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 140.5MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:11,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.06ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 77.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 140.5MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,967 INFO L158 Benchmark]: Boogie Preprocessor took 67.26ms. Allocated memory is still 140.5MB. Free memory was 75.7MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:11,967 INFO L158 Benchmark]: RCFGBuilder took 490.16ms. Allocated memory is still 140.5MB. Free memory was 74.5MB in the beginning and 60.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,972 INFO L158 Benchmark]: TraceAbstraction took 33054.95ms. Allocated memory was 140.5MB in the beginning and 264.2MB in the end (delta: 123.7MB). Free memory was 59.2MB in the beginning and 178.7MB in the end (delta: -119.4MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,974 INFO L158 Benchmark]: Witness Printer took 106.53ms. Allocated memory is still 264.2MB. Free memory was 178.7MB in the beginning and 173.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:11,975 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.56ms. Allocated memory is still 140.5MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.06ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 77.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 140.5MB. Free memory was 77.8MB in the beginning and 76.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.26ms. Allocated memory is still 140.5MB. Free memory was 75.7MB in the beginning and 74.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 490.16ms. Allocated memory is still 140.5MB. Free memory was 74.5MB in the beginning and 60.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33054.95ms. Allocated memory was 140.5MB in the beginning and 264.2MB in the end (delta: 123.7MB). Free memory was 59.2MB in the beginning and 178.7MB in the end (delta: -119.4MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Witness Printer took 106.53ms. Allocated memory is still 264.2MB. Free memory was 178.7MB in the beginning and 173.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][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: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: 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, 42 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 84 mSolverCounterUnknown, 2424 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2424 mSDsluCounter, 3782 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 381 IncrementalHoareTripleChecker+Unchecked, 2951 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4207 IncrementalHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 831 mSDtfsCounter, 4207 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 290 SyntacticMatches, 7 SemanticMatches, 497 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4708 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=25, InterpolantAutomatonStates: 407, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 1185 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 19 NumberOfFragments, 296 HoareAnnotationTreeSize, 3 FomulaSimplifications, 18288 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6173 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 787 ConstructedInterpolants, 76 QuantifiedInterpolants, 12193 SizeOfPredicates, 66 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 38 InterpolantComputations, 25 PerfectInterpolantSequences, 186/309 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 555]: Loop Invariant [2023-11-06 23:11:12,004 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,014 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,015 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,015 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,015 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,015 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,015 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated [2023-11-06 23:11:12,016 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated [2023-11-06 23:11:12,016 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,016 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,016 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,016 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,017 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,018 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,018 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,018 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,018 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,018 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,019 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,019 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,019 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,019 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,019 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,021 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,021 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_2 : [int]int :: #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0] <= 2147483647 && #memory_int[~y_ref~0!base][0] == #memory_int[~y_ref~0!base := v_DerPreprocessor_2][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0]) could not be translated [2023-11-06 23:11:12,022 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc4#1.base : int :: (exists v_DerPreprocessor_1 : [int]int, v_DerPreprocessor_2 : [int]int :: (((v_DerPreprocessor_1 == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] && #memory_int[~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~y_ref~0!base][0] == #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_1][~y_ref~0!base := v_DerPreprocessor_2][ULTIMATE.start_test_fun_#t~malloc4#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc4#1.base]][~y_ref~0!base][0] <= 2147483647) && !(~y_ref~0!base == ULTIMATE.start_test_fun_#t~malloc4#1.base)) could not be translated [2023-11-06 23:11:12,023 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,023 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,023 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,023 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,023 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,024 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,025 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,025 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base] could not be translated [2023-11-06 23:11:12,025 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-06 23:11:12,025 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,040 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,040 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,041 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-06 23:11:12,041 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base] could not be translated [2023-11-06 23:11:12,041 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated Derived loop invariant: ((!((y_ref == x_ref)) || !((y_ref == x_ref))) || !((y_ref == x_ref))) - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: (*x_ref < 2147483648) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:11:12,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f05d8ff-eab7-4f0c-aa83-69a18cb3d753/bin/uautomizer-verify-WvqO1wxjHP/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