./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/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_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/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 32bit --witnessprinter.graph.data.programhash 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:09:54,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:09:54,188 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 23:09:54,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:09:54,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:09:54,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:09:54,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:09:54,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:09:54,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:09:54,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:09:54,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:09:54,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:09:54,248 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:09:54,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:09:54,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:09:54,251 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:09:54,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:09:54,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:09:54,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:09:54,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:09:54,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:09:54,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:09:54,254 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:09:54,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:09:54,256 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:09:54,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:09:54,257 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:09:54,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:09:54,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:09:54,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:09:54,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:54,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:09:54,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:09:54,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:09:54,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:09:54,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:09:54,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:09:54,262 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:09:54,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:09:54,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:09:54,262 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:09:54,263 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_665386a1-e2bf-4b27-97ce-4a123a1856e2/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_665386a1-e2bf-4b27-97ce-4a123a1856e2/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2023-11-06 23:09:54,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:09:54,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:09:54,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:09:54,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:09:54,634 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:09:54,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 23:09:57,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:09:57,960 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:09:57,961 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 23:09:57,972 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/data/f4f56aa6b/7f6db26a2c0f4be6bbbee6bd3510d4a5/FLAG54f4b7c94 [2023-11-06 23:09:57,987 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/data/f4f56aa6b/7f6db26a2c0f4be6bbbee6bd3510d4a5 [2023-11-06 23:09:57,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:09:57,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:09:57,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:57,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:09:57,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:09:57,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:57" (1/1) ... [2023-11-06 23:09:58,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f561bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58, skipping insertion in model container [2023-11-06 23:09:58,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:09:57" (1/1) ... [2023-11-06 23:09:58,040 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:09:58,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:58,279 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:09:58,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:09:58,345 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:09:58,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58 WrapperNode [2023-11-06 23:09:58,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:09:58,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:58,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:09:58,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:09:58,355 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:09:58" (1/1) ... [2023-11-06 23:09:58,365 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:09:58" (1/1) ... [2023-11-06 23:09:58,406 INFO L138 Inliner]: procedures = 23, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 302 [2023-11-06 23:09:58,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:09:58,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:09:58,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:09:58,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:09:58,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:09:58,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:09:58,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:09:58,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:09:58,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (1/1) ... [2023-11-06 23:09:58,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:09:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:09:58,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/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:09:58,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/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:09:58,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:09:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:09:58,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:09:58,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:09:58,757 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:09:58,759 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:09:59,277 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:09:59,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:09:59,285 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:09:59,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:59 BoogieIcfgContainer [2023-11-06 23:09:59,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:09:59,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:09:59,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:09:59,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:09:59,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:09:57" (1/3) ... [2023-11-06 23:09:59,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6695257d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:59, skipping insertion in model container [2023-11-06 23:09:59,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:09:58" (2/3) ... [2023-11-06 23:09:59,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6695257d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:09:59, skipping insertion in model container [2023-11-06 23:09:59,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:59" (3/3) ... [2023-11-06 23:09:59,298 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2023-11-06 23:09:59,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:09:59,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-06 23:09:59,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:09:59,399 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;@2b985514, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:09:59,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-06 23:09:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 90 states have internal predecessors, (131), 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:09:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 23:09:59,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:59,414 INFO L195 NwaCegarLoop]: trace histogram [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:09:59,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:09:59,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1523334527, now seen corresponding path program 1 times [2023-11-06 23:09:59,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13798197] [2023-11-06 23:09:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:59,719 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:09:59,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13798197] [2023-11-06 23:09:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13798197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:09:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740780610] [2023-11-06 23:09:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:59,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:09:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:59,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:09:59,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:09:59,777 INFO L87 Difference]: Start difference. First operand has 91 states, 75 states have (on average 1.7466666666666666) internal successors, (131), 90 states have internal predecessors, (131), 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 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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:09:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:09:59,819 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-11-06 23:09:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:09:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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:09:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:09:59,837 INFO L225 Difference]: With dead ends: 94 [2023-11-06 23:09:59,837 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 23:09:59,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:09:59,844 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:09:59,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:09:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 23:09:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-06 23:09:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 82 states have internal predecessors, (105), 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:09:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2023-11-06 23:09:59,891 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 23 [2023-11-06 23:09:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:09:59,892 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2023-11-06 23:09:59,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 23.0) internal successors, (23), 2 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:09:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2023-11-06 23:09:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 23:09:59,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:09:59,895 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:59,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:09:59,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:09:59,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1695954455, now seen corresponding path program 1 times [2023-11-06 23:09:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479293828] [2023-11-06 23:09:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:00,162 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:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479293828] [2023-11-06 23:10:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479293828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:00,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:00,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761856146] [2023-11-06 23:10:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:00,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:00,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:00,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:00,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:00,171 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:00,242 INFO L93 Difference]: Finished difference Result 203 states and 264 transitions. [2023-11-06 23:10:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:00,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-06 23:10:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:00,254 INFO L225 Difference]: With dead ends: 203 [2023-11-06 23:10:00,254 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 23:10:00,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:00,257 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 71 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:00,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 23:10:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2023-11-06 23:10:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 122 states have internal predecessors, (170), 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:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2023-11-06 23:10:00,309 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 34 [2023-11-06 23:10:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:00,309 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2023-11-06 23:10:00,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2023-11-06 23:10:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 23:10:00,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:00,311 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:00,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:00,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:00,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1943407502, now seen corresponding path program 1 times [2023-11-06 23:10:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668820095] [2023-11-06 23:10:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:00,466 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:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668820095] [2023-11-06 23:10:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668820095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599426540] [2023-11-06 23:10:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:00,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:00,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:00,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:00,470 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:00,545 INFO L93 Difference]: Finished difference Result 315 states and 446 transitions. [2023-11-06 23:10:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:00,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2023-11-06 23:10:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:00,548 INFO L225 Difference]: With dead ends: 315 [2023-11-06 23:10:00,549 INFO L226 Difference]: Without dead ends: 211 [2023-11-06 23:10:00,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:00,551 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:00,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-06 23:10:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2023-11-06 23:10:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.5628415300546448) internal successors, (286), 194 states have internal predecessors, (286), 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:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2023-11-06 23:10:00,591 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 35 [2023-11-06 23:10:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:00,591 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2023-11-06 23:10:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2023-11-06 23:10:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 23:10:00,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:00,593 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:00,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:00,594 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:00,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2103371824, now seen corresponding path program 1 times [2023-11-06 23:10:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336431967] [2023-11-06 23:10:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:00,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:00,748 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:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336431967] [2023-11-06 23:10:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336431967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632324051] [2023-11-06 23:10:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:00,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:00,754 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:00,991 INFO L93 Difference]: Finished difference Result 368 states and 553 transitions. [2023-11-06 23:10:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:00,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2023-11-06 23:10:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:00,998 INFO L225 Difference]: With dead ends: 368 [2023-11-06 23:10:00,999 INFO L226 Difference]: Without dead ends: 365 [2023-11-06 23:10:00,999 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:01,004 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:01,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 142 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-06 23:10:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 356. [2023-11-06 23:10:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.566860465116279) internal successors, (539), 355 states have internal predecessors, (539), 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:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2023-11-06 23:10:01,105 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 36 [2023-11-06 23:10:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:01,106 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2023-11-06 23:10:01,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2023-11-06 23:10:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 23:10:01,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:01,110 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:01,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:01,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:01,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -780016968, now seen corresponding path program 1 times [2023-11-06 23:10:01,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:01,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253366748] [2023-11-06 23:10:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,287 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:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253366748] [2023-11-06 23:10:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253366748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:01,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591255004] [2023-11-06 23:10:01,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:01,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:01,292 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:01,516 INFO L93 Difference]: Finished difference Result 702 states and 1055 transitions. [2023-11-06 23:10:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-11-06 23:10:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:01,523 INFO L225 Difference]: With dead ends: 702 [2023-11-06 23:10:01,524 INFO L226 Difference]: Without dead ends: 699 [2023-11-06 23:10:01,525 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:01,532 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 233 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:01,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 254 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-11-06 23:10:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2023-11-06 23:10:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 506 states have (on average 1.551383399209486) internal successors, (785), 517 states have internal predecessors, (785), 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:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 785 transitions. [2023-11-06 23:10:01,612 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 785 transitions. Word has length 37 [2023-11-06 23:10:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:01,613 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 785 transitions. [2023-11-06 23:10:01,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 785 transitions. [2023-11-06 23:10:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 23:10:01,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:01,619 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:01,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:01,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:01,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1589277906, now seen corresponding path program 1 times [2023-11-06 23:10:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716902227] [2023-11-06 23:10:01,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:01,786 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:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716902227] [2023-11-06 23:10:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716902227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707319503] [2023-11-06 23:10:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:01,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:01,818 INFO L87 Difference]: Start difference. First operand 518 states and 785 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:02,152 INFO L93 Difference]: Finished difference Result 864 states and 1315 transitions. [2023-11-06 23:10:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-06 23:10:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:02,159 INFO L225 Difference]: With dead ends: 864 [2023-11-06 23:10:02,160 INFO L226 Difference]: Without dead ends: 861 [2023-11-06 23:10:02,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:02,162 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 476 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:02,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 291 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-11-06 23:10:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 842. [2023-11-06 23:10:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 830 states have (on average 1.5409638554216867) internal successors, (1279), 841 states have internal predecessors, (1279), 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:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1279 transitions. [2023-11-06 23:10:02,274 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1279 transitions. Word has length 38 [2023-11-06 23:10:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:02,275 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1279 transitions. [2023-11-06 23:10:02,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1279 transitions. [2023-11-06 23:10:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:10:02,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:02,276 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:02,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:10:02,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:02,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2022974970, now seen corresponding path program 1 times [2023-11-06 23:10:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476775256] [2023-11-06 23:10:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:02,394 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:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476775256] [2023-11-06 23:10:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476775256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077535976] [2023-11-06 23:10:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:02,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:02,399 INFO L87 Difference]: Start difference. First operand 842 states and 1279 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:02,945 INFO L93 Difference]: Finished difference Result 2668 states and 4039 transitions. [2023-11-06 23:10:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:10:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-06 23:10:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:02,960 INFO L225 Difference]: With dead ends: 2668 [2023-11-06 23:10:02,960 INFO L226 Difference]: Without dead ends: 1837 [2023-11-06 23:10:02,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:02,969 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 432 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:02,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 595 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:10:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2023-11-06 23:10:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1325. [2023-11-06 23:10:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1313 states have (on average 1.5041888804265042) internal successors, (1975), 1324 states have internal predecessors, (1975), 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:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1975 transitions. [2023-11-06 23:10:03,141 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1975 transitions. Word has length 39 [2023-11-06 23:10:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:03,141 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1975 transitions. [2023-11-06 23:10:03,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1975 transitions. [2023-11-06 23:10:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:10:03,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:03,145 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:03,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:03,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:03,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash 130408946, now seen corresponding path program 1 times [2023-11-06 23:10:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756544773] [2023-11-06 23:10:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:03,234 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:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756544773] [2023-11-06 23:10:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756544773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930335450] [2023-11-06 23:10:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:03,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:03,237 INFO L87 Difference]: Start difference. First operand 1325 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:03,594 INFO L93 Difference]: Finished difference Result 3585 states and 5343 transitions. [2023-11-06 23:10:03,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:03,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-11-06 23:10:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:03,608 INFO L225 Difference]: With dead ends: 3585 [2023-11-06 23:10:03,609 INFO L226 Difference]: Without dead ends: 2279 [2023-11-06 23:10:03,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:03,612 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:03,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 248 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-11-06 23:10:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2253. [2023-11-06 23:10:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2241 states have (on average 1.4881749219098617) internal successors, (3335), 2252 states have internal predecessors, (3335), 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:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3335 transitions. [2023-11-06 23:10:03,977 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3335 transitions. Word has length 40 [2023-11-06 23:10:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:03,977 INFO L495 AbstractCegarLoop]: Abstraction has 2253 states and 3335 transitions. [2023-11-06 23:10:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3335 transitions. [2023-11-06 23:10:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 23:10:03,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:03,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:03,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:10:03,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:03,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1882770870, now seen corresponding path program 1 times [2023-11-06 23:10:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:03,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160056356] [2023-11-06 23:10:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160056356] [2023-11-06 23:10:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160056356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:04,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718325025] [2023-11-06 23:10:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:04,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:04,108 INFO L87 Difference]: Start difference. First operand 2253 states and 3335 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:04,550 INFO L93 Difference]: Finished difference Result 5203 states and 7673 transitions. [2023-11-06 23:10:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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) Word has length 62 [2023-11-06 23:10:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:04,569 INFO L225 Difference]: With dead ends: 5203 [2023-11-06 23:10:04,570 INFO L226 Difference]: Without dead ends: 2969 [2023-11-06 23:10:04,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:04,580 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:04,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 180 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2023-11-06 23:10:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2923. [2023-11-06 23:10:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.467880453452422) internal successors, (4273), 2922 states have internal predecessors, (4273), 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:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4273 transitions. [2023-11-06 23:10:04,990 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4273 transitions. Word has length 62 [2023-11-06 23:10:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:04,996 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4273 transitions. [2023-11-06 23:10:04,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4273 transitions. [2023-11-06 23:10:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 23:10:04,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:04,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:04,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:10:04,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:05,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash -572370161, now seen corresponding path program 1 times [2023-11-06 23:10:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:05,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077794583] [2023-11-06 23:10:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077794583] [2023-11-06 23:10:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077794583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065925222] [2023-11-06 23:10:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:05,273 INFO L87 Difference]: Start difference. First operand 2923 states and 4273 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:05,852 INFO L93 Difference]: Finished difference Result 5831 states and 8525 transitions. [2023-11-06 23:10:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2023-11-06 23:10:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:05,871 INFO L225 Difference]: With dead ends: 5831 [2023-11-06 23:10:05,871 INFO L226 Difference]: Without dead ends: 2929 [2023-11-06 23:10:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:05,876 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:05,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 217 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2023-11-06 23:10:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2923. [2023-11-06 23:10:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2911 states have (on average 1.456887667468224) internal successors, (4241), 2922 states have internal predecessors, (4241), 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:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 4241 transitions. [2023-11-06 23:10:06,276 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 4241 transitions. Word has length 66 [2023-11-06 23:10:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:06,277 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 4241 transitions. [2023-11-06 23:10:06,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 4241 transitions. [2023-11-06 23:10:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 23:10:06,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:06,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:10:06,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:10:06,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:06,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1347932395, now seen corresponding path program 1 times [2023-11-06 23:10:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847830050] [2023-11-06 23:10:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:06,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847830050] [2023-11-06 23:10:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847830050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550596225] [2023-11-06 23:10:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:06,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:06,394 INFO L87 Difference]: Start difference. First operand 2923 states and 4241 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:06,897 INFO L93 Difference]: Finished difference Result 3774 states and 5487 transitions. [2023-11-06 23:10:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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) Word has length 67 [2023-11-06 23:10:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:06,920 INFO L225 Difference]: With dead ends: 3774 [2023-11-06 23:10:06,920 INFO L226 Difference]: Without dead ends: 3769 [2023-11-06 23:10:06,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:06,923 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:06,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 283 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2023-11-06 23:10:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 2933. [2023-11-06 23:10:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2921 states have (on average 1.4649092776446422) internal successors, (4279), 2932 states have internal predecessors, (4279), 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:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4279 transitions. [2023-11-06 23:10:07,298 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4279 transitions. Word has length 67 [2023-11-06 23:10:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:07,299 INFO L495 AbstractCegarLoop]: Abstraction has 2933 states and 4279 transitions. [2023-11-06 23:10:07,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 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:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4279 transitions. [2023-11-06 23:10:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 23:10:07,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:07,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:07,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:07,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:07,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1163768577, now seen corresponding path program 1 times [2023-11-06 23:10:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:07,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731576551] [2023-11-06 23:10:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:07,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731576551] [2023-11-06 23:10:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731576551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94192658] [2023-11-06 23:10:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:07,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:07,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:07,451 INFO L87 Difference]: Start difference. First operand 2933 states and 4279 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:08,272 INFO L93 Difference]: Finished difference Result 8223 states and 12078 transitions. [2023-11-06 23:10:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:08,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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) Word has length 68 [2023-11-06 23:10:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:08,307 INFO L225 Difference]: With dead ends: 8223 [2023-11-06 23:10:08,307 INFO L226 Difference]: Without dead ends: 5311 [2023-11-06 23:10:08,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:08,313 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 284 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:08,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 278 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2023-11-06 23:10:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4587. [2023-11-06 23:10:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4587 states, 4575 states have (on average 1.4708196721311475) internal successors, (6729), 4586 states have internal predecessors, (6729), 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:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 6729 transitions. [2023-11-06 23:10:08,915 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 6729 transitions. Word has length 68 [2023-11-06 23:10:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:08,915 INFO L495 AbstractCegarLoop]: Abstraction has 4587 states and 6729 transitions. [2023-11-06 23:10:08,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 6729 transitions. [2023-11-06 23:10:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 23:10:08,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:08,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1, 1] [2023-11-06 23:10:08,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:08,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:08,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1651039598, now seen corresponding path program 1 times [2023-11-06 23:10:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025090592] [2023-11-06 23:10:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:09,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025090592] [2023-11-06 23:10:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025090592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881423600] [2023-11-06 23:10:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:09,037 INFO L87 Difference]: Start difference. First operand 4587 states and 6729 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:09,638 INFO L93 Difference]: Finished difference Result 4592 states and 6731 transitions. [2023-11-06 23:10:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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 68 [2023-11-06 23:10:09,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:09,683 INFO L225 Difference]: With dead ends: 4592 [2023-11-06 23:10:09,683 INFO L226 Difference]: Without dead ends: 4589 [2023-11-06 23:10:09,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:09,686 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:09,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 213 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2023-11-06 23:10:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4581. [2023-11-06 23:10:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4572 states have (on average 1.4494750656167978) internal successors, (6627), 4580 states have internal predecessors, (6627), 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:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6627 transitions. [2023-11-06 23:10:10,460 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6627 transitions. Word has length 68 [2023-11-06 23:10:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:10,460 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 6627 transitions. [2023-11-06 23:10:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 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:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6627 transitions. [2023-11-06 23:10:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 23:10:10,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:10,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:10,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:10,463 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:10,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1717087379, now seen corresponding path program 1 times [2023-11-06 23:10:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808273479] [2023-11-06 23:10:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:10,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808273479] [2023-11-06 23:10:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808273479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:10,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399819538] [2023-11-06 23:10:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:10,595 INFO L87 Difference]: Start difference. First operand 4581 states and 6627 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:11,427 INFO L93 Difference]: Finished difference Result 9150 states and 13227 transitions. [2023-11-06 23:10:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 69 [2023-11-06 23:10:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:11,441 INFO L225 Difference]: With dead ends: 9150 [2023-11-06 23:10:11,442 INFO L226 Difference]: Without dead ends: 5406 [2023-11-06 23:10:11,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:11,450 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 251 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:11,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 371 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2023-11-06 23:10:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 5401. [2023-11-06 23:10:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5392 states have (on average 1.4256305637982196) internal successors, (7687), 5400 states have internal predecessors, (7687), 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:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7687 transitions. [2023-11-06 23:10:12,202 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7687 transitions. Word has length 69 [2023-11-06 23:10:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:12,202 INFO L495 AbstractCegarLoop]: Abstraction has 5401 states and 7687 transitions. [2023-11-06 23:10:12,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7687 transitions. [2023-11-06 23:10:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 23:10:12,204 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:12,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:10:12,206 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:12,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1070854285, now seen corresponding path program 1 times [2023-11-06 23:10:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23102964] [2023-11-06 23:10:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:10:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23102964] [2023-11-06 23:10:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23102964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:12,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91932169] [2023-11-06 23:10:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:12,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:12,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:12,384 INFO L87 Difference]: Start difference. First operand 5401 states and 7687 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:13,251 INFO L93 Difference]: Finished difference Result 9970 states and 14299 transitions. [2023-11-06 23:10:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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) Word has length 69 [2023-11-06 23:10:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:13,266 INFO L225 Difference]: With dead ends: 9970 [2023-11-06 23:10:13,266 INFO L226 Difference]: Without dead ends: 5406 [2023-11-06 23:10:13,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:13,276 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 256 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:13,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 353 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2023-11-06 23:10:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 5401. [2023-11-06 23:10:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5401 states, 5392 states have (on average 1.4174703264094954) internal successors, (7643), 5400 states have internal predecessors, (7643), 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:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7643 transitions. [2023-11-06 23:10:13,933 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7643 transitions. Word has length 69 [2023-11-06 23:10:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:13,933 INFO L495 AbstractCegarLoop]: Abstraction has 5401 states and 7643 transitions. [2023-11-06 23:10:13,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 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:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7643 transitions. [2023-11-06 23:10:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-06 23:10:13,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:13,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2023-11-06 23:10:13,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:10:13,936 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:13,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 357380150, now seen corresponding path program 1 times [2023-11-06 23:10:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780732474] [2023-11-06 23:10:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780732474] [2023-11-06 23:10:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780732474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977023568] [2023-11-06 23:10:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:14,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:14,041 INFO L87 Difference]: Start difference. First operand 5401 states and 7643 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:14,711 INFO L93 Difference]: Finished difference Result 7075 states and 10119 transitions. [2023-11-06 23:10:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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 69 [2023-11-06 23:10:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:14,728 INFO L225 Difference]: With dead ends: 7075 [2023-11-06 23:10:14,729 INFO L226 Difference]: Without dead ends: 7070 [2023-11-06 23:10:14,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:14,733 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:14,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 272 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7070 states. [2023-11-06 23:10:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7070 to 7059. [2023-11-06 23:10:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7059 states, 7050 states have (on average 1.4180141843971632) internal successors, (9997), 7058 states have internal predecessors, (9997), 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:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7059 states to 7059 states and 9997 transitions. [2023-11-06 23:10:15,320 INFO L78 Accepts]: Start accepts. Automaton has 7059 states and 9997 transitions. Word has length 69 [2023-11-06 23:10:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:15,321 INFO L495 AbstractCegarLoop]: Abstraction has 7059 states and 9997 transitions. [2023-11-06 23:10:15,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 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:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7059 states and 9997 transitions. [2023-11-06 23:10:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 23:10:15,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:15,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1, 1] [2023-11-06 23:10:15,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:10:15,323 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:15,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1806117100, now seen corresponding path program 1 times [2023-11-06 23:10:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845200267] [2023-11-06 23:10:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845200267] [2023-11-06 23:10:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845200267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038773773] [2023-11-06 23:10:15,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:15,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:15,440 INFO L87 Difference]: Start difference. First operand 7059 states and 9997 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:16,266 INFO L93 Difference]: Finished difference Result 13320 states and 19251 transitions. [2023-11-06 23:10:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 70 [2023-11-06 23:10:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:16,285 INFO L225 Difference]: With dead ends: 13320 [2023-11-06 23:10:16,285 INFO L226 Difference]: Without dead ends: 8330 [2023-11-06 23:10:16,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:16,294 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 278 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:16,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 269 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2023-11-06 23:10:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6913. [2023-11-06 23:10:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6904 states have (on average 1.4216396292004636) internal successors, (9815), 6912 states have internal predecessors, (9815), 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:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 9815 transitions. [2023-11-06 23:10:17,162 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 9815 transitions. Word has length 70 [2023-11-06 23:10:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:17,163 INFO L495 AbstractCegarLoop]: Abstraction has 6913 states and 9815 transitions. [2023-11-06 23:10:17,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 9815 transitions. [2023-11-06 23:10:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 23:10:17,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:17,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:10:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:10:17,170 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:17,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash 536801861, now seen corresponding path program 1 times [2023-11-06 23:10:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973857626] [2023-11-06 23:10:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973857626] [2023-11-06 23:10:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973857626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:17,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:17,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036207846] [2023-11-06 23:10:17,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:17,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:17,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:17,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:17,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:17,327 INFO L87 Difference]: Start difference. First operand 6913 states and 9815 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:18,344 INFO L93 Difference]: Finished difference Result 7335 states and 10395 transitions. [2023-11-06 23:10:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 71 [2023-11-06 23:10:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:18,361 INFO L225 Difference]: With dead ends: 7335 [2023-11-06 23:10:18,361 INFO L226 Difference]: Without dead ends: 7328 [2023-11-06 23:10:18,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:18,363 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 167 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:18,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 431 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2023-11-06 23:10:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7321. [2023-11-06 23:10:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7321 states, 7312 states have (on average 1.411788840262582) internal successors, (10323), 7320 states have internal predecessors, (10323), 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:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 10323 transitions. [2023-11-06 23:10:19,137 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 10323 transitions. Word has length 71 [2023-11-06 23:10:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:19,138 INFO L495 AbstractCegarLoop]: Abstraction has 7321 states and 10323 transitions. [2023-11-06 23:10:19,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 10323 transitions. [2023-11-06 23:10:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 23:10:19,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:19,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2023-11-06 23:10:19,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:10:19,140 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:19,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash -471598904, now seen corresponding path program 1 times [2023-11-06 23:10:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301545050] [2023-11-06 23:10:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:19,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301545050] [2023-11-06 23:10:19,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301545050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455300467] [2023-11-06 23:10:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:19,239 INFO L87 Difference]: Start difference. First operand 7321 states and 10323 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:20,166 INFO L93 Difference]: Finished difference Result 9554 states and 13619 transitions. [2023-11-06 23:10:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 71 [2023-11-06 23:10:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:20,191 INFO L225 Difference]: With dead ends: 9554 [2023-11-06 23:10:20,191 INFO L226 Difference]: Without dead ends: 9549 [2023-11-06 23:10:20,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:20,195 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 147 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 407 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2023-11-06 23:10:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 8979. [2023-11-06 23:10:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8979 states, 8970 states have (on average 1.4007803790412485) internal successors, (12565), 8978 states have internal predecessors, (12565), 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:21,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8979 states to 8979 states and 12565 transitions. [2023-11-06 23:10:21,096 INFO L78 Accepts]: Start accepts. Automaton has 8979 states and 12565 transitions. Word has length 71 [2023-11-06 23:10:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:21,096 INFO L495 AbstractCegarLoop]: Abstraction has 8979 states and 12565 transitions. [2023-11-06 23:10:21,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8979 states and 12565 transitions. [2023-11-06 23:10:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 23:10:21,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:21,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 1] [2023-11-06 23:10:21,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:10:21,099 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:21,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash -155055112, now seen corresponding path program 1 times [2023-11-06 23:10:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010256480] [2023-11-06 23:10:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010256480] [2023-11-06 23:10:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010256480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:21,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98263201] [2023-11-06 23:10:21,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:21,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:21,285 INFO L87 Difference]: Start difference. First operand 8979 states and 12565 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:22,386 INFO L93 Difference]: Finished difference Result 13695 states and 19221 transitions. [2023-11-06 23:10:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 71 [2023-11-06 23:10:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:22,409 INFO L225 Difference]: With dead ends: 13695 [2023-11-06 23:10:22,410 INFO L226 Difference]: Without dead ends: 9814 [2023-11-06 23:10:22,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:22,417 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 243 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:22,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 389 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2023-11-06 23:10:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 9255. [2023-11-06 23:10:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9255 states, 9246 states have (on average 1.3979017953709711) internal successors, (12925), 9254 states have internal predecessors, (12925), 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:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 12925 transitions. [2023-11-06 23:10:23,587 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 12925 transitions. Word has length 71 [2023-11-06 23:10:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:23,587 INFO L495 AbstractCegarLoop]: Abstraction has 9255 states and 12925 transitions. [2023-11-06 23:10:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 12925 transitions. [2023-11-06 23:10:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 23:10:23,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:23,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1] [2023-11-06 23:10:23,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:10:23,594 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:23,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1734663998, now seen corresponding path program 1 times [2023-11-06 23:10:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466905448] [2023-11-06 23:10:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466905448] [2023-11-06 23:10:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466905448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337583999] [2023-11-06 23:10:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:23,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:23,753 INFO L87 Difference]: Start difference. First operand 9255 states and 12925 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 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:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:24,751 INFO L93 Difference]: Finished difference Result 11522 states and 16131 transitions. [2023-11-06 23:10:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 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) Word has length 72 [2023-11-06 23:10:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:24,765 INFO L225 Difference]: With dead ends: 11522 [2023-11-06 23:10:24,765 INFO L226 Difference]: Without dead ends: 7645 [2023-11-06 23:10:24,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:24,773 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 191 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:24,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 313 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2023-11-06 23:10:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 5609. [2023-11-06 23:10:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5609 states, 5600 states have (on average 1.383392857142857) internal successors, (7747), 5608 states have internal predecessors, (7747), 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:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5609 states to 5609 states and 7747 transitions. [2023-11-06 23:10:25,492 INFO L78 Accepts]: Start accepts. Automaton has 5609 states and 7747 transitions. Word has length 72 [2023-11-06 23:10:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:25,492 INFO L495 AbstractCegarLoop]: Abstraction has 5609 states and 7747 transitions. [2023-11-06 23:10:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 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:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5609 states and 7747 transitions. [2023-11-06 23:10:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 23:10:25,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:25,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2023-11-06 23:10:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:10:25,495 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:25,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2059991050, now seen corresponding path program 1 times [2023-11-06 23:10:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710667550] [2023-11-06 23:10:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710667550] [2023-11-06 23:10:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710667550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637161833] [2023-11-06 23:10:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:25,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:25,620 INFO L87 Difference]: Start difference. First operand 5609 states and 7747 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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:26,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:26,642 INFO L93 Difference]: Finished difference Result 6676 states and 9295 transitions. [2023-11-06 23:10:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2023-11-06 23:10:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:26,650 INFO L225 Difference]: With dead ends: 6676 [2023-11-06 23:10:26,650 INFO L226 Difference]: Without dead ends: 6675 [2023-11-06 23:10:26,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:26,653 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 175 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:26,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 391 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2023-11-06 23:10:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 6657. [2023-11-06 23:10:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6648 states have (on average 1.395156438026474) internal successors, (9275), 6656 states have internal predecessors, (9275), 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:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9275 transitions. [2023-11-06 23:10:27,459 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9275 transitions. Word has length 73 [2023-11-06 23:10:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:27,459 INFO L495 AbstractCegarLoop]: Abstraction has 6657 states and 9275 transitions. [2023-11-06 23:10:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9275 transitions. [2023-11-06 23:10:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 23:10:27,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:27,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2023-11-06 23:10:27,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 23:10:27,462 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:27,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1588743152, now seen corresponding path program 1 times [2023-11-06 23:10:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387114816] [2023-11-06 23:10:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:27,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387114816] [2023-11-06 23:10:27,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387114816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:27,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:27,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777662743] [2023-11-06 23:10:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:27,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:27,578 INFO L87 Difference]: Start difference. First operand 6657 states and 9275 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:28,670 INFO L93 Difference]: Finished difference Result 6947 states and 9675 transitions. [2023-11-06 23:10:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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 73 [2023-11-06 23:10:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:28,680 INFO L225 Difference]: With dead ends: 6947 [2023-11-06 23:10:28,680 INFO L226 Difference]: Without dead ends: 6940 [2023-11-06 23:10:28,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:28,683 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 189 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:28,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 379 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2023-11-06 23:10:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6933. [2023-11-06 23:10:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6924 states have (on average 1.3926920854997111) internal successors, (9643), 6932 states have internal predecessors, (9643), 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:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 9643 transitions. [2023-11-06 23:10:29,592 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 9643 transitions. Word has length 73 [2023-11-06 23:10:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:29,593 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 9643 transitions. [2023-11-06 23:10:29,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 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:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 9643 transitions. [2023-11-06 23:10:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-06 23:10:29,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:29,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1] [2023-11-06 23:10:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:10:29,596 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:29,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1061807010, now seen corresponding path program 1 times [2023-11-06 23:10:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610519779] [2023-11-06 23:10:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610519779] [2023-11-06 23:10:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610519779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569204232] [2023-11-06 23:10:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:29,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:29,709 INFO L87 Difference]: Start difference. First operand 6933 states and 9643 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:30,868 INFO L93 Difference]: Finished difference Result 7162 states and 9951 transitions. [2023-11-06 23:10:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:30,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-11-06 23:10:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:30,880 INFO L225 Difference]: With dead ends: 7162 [2023-11-06 23:10:30,881 INFO L226 Difference]: Without dead ends: 6721 [2023-11-06 23:10:30,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:30,886 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 192 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:30,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 476 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2023-11-06 23:10:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6713. [2023-11-06 23:10:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6713 states, 6704 states have (on average 1.3912589498806682) internal successors, (9327), 6712 states have internal predecessors, (9327), 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:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6713 states to 6713 states and 9327 transitions. [2023-11-06 23:10:31,716 INFO L78 Accepts]: Start accepts. Automaton has 6713 states and 9327 transitions. Word has length 75 [2023-11-06 23:10:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:31,717 INFO L495 AbstractCegarLoop]: Abstraction has 6713 states and 9327 transitions. [2023-11-06 23:10:31,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 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:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6713 states and 9327 transitions. [2023-11-06 23:10:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 23:10:31,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:31,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:31,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:10:31,722 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:31,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1763683459, now seen corresponding path program 1 times [2023-11-06 23:10:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444157471] [2023-11-06 23:10:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444157471] [2023-11-06 23:10:31,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444157471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:31,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:31,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:31,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818668165] [2023-11-06 23:10:31,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:31,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:31,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:31,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:31,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:31,830 INFO L87 Difference]: Start difference. First operand 6713 states and 9327 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:32,656 INFO L93 Difference]: Finished difference Result 6945 states and 9633 transitions. [2023-11-06 23:10:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:32,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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 96 [2023-11-06 23:10:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:32,664 INFO L225 Difference]: With dead ends: 6945 [2023-11-06 23:10:32,664 INFO L226 Difference]: Without dead ends: 6940 [2023-11-06 23:10:32,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:32,667 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 128 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:32,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 335 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2023-11-06 23:10:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6706. [2023-11-06 23:10:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6700 states have (on average 1.363731343283582) internal successors, (9137), 6705 states have internal predecessors, (9137), 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:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 9137 transitions. [2023-11-06 23:10:33,378 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 9137 transitions. Word has length 96 [2023-11-06 23:10:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:33,378 INFO L495 AbstractCegarLoop]: Abstraction has 6706 states and 9137 transitions. [2023-11-06 23:10:33,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 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:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 9137 transitions. [2023-11-06 23:10:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 23:10:33,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:33,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:33,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 23:10:33,383 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:33,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1612282239, now seen corresponding path program 1 times [2023-11-06 23:10:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397610995] [2023-11-06 23:10:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397610995] [2023-11-06 23:10:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397610995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010369838] [2023-11-06 23:10:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:33,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:33,522 INFO L87 Difference]: Start difference. First operand 6706 states and 9137 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:34,563 INFO L93 Difference]: Finished difference Result 9819 states and 13497 transitions. [2023-11-06 23:10:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:34,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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 98 [2023-11-06 23:10:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:34,570 INFO L225 Difference]: With dead ends: 9819 [2023-11-06 23:10:34,570 INFO L226 Difference]: Without dead ends: 5854 [2023-11-06 23:10:34,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:34,577 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 176 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:34,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 481 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2023-11-06 23:10:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5834. [2023-11-06 23:10:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5834 states, 5828 states have (on average 1.3618737131091283) internal successors, (7937), 5833 states have internal predecessors, (7937), 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:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 7937 transitions. [2023-11-06 23:10:35,275 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 7937 transitions. Word has length 98 [2023-11-06 23:10:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:35,275 INFO L495 AbstractCegarLoop]: Abstraction has 5834 states and 7937 transitions. [2023-11-06 23:10:35,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 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:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 7937 transitions. [2023-11-06 23:10:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 23:10:35,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:35,279 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:35,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 23:10:35,279 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:35,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1406860725, now seen corresponding path program 2 times [2023-11-06 23:10:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433135957] [2023-11-06 23:10:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:10:35,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433135957] [2023-11-06 23:10:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433135957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:35,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319714752] [2023-11-06 23:10:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:35,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:35,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:35,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:35,424 INFO L87 Difference]: Start difference. First operand 5834 states and 7937 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:36,328 INFO L93 Difference]: Finished difference Result 6075 states and 8249 transitions. [2023-11-06 23:10:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:36,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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 98 [2023-11-06 23:10:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:36,334 INFO L225 Difference]: With dead ends: 6075 [2023-11-06 23:10:36,334 INFO L226 Difference]: Without dead ends: 5082 [2023-11-06 23:10:36,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:36,337 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 184 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:36,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 556 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2023-11-06 23:10:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 5062. [2023-11-06 23:10:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 5056 states have (on average 1.364121835443038) internal successors, (6897), 5061 states have internal predecessors, (6897), 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:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 6897 transitions. [2023-11-06 23:10:36,784 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 6897 transitions. Word has length 98 [2023-11-06 23:10:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:36,785 INFO L495 AbstractCegarLoop]: Abstraction has 5062 states and 6897 transitions. [2023-11-06 23:10:36,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 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:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 6897 transitions. [2023-11-06 23:10:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 23:10:36,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:36,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 23:10:36,789 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:36,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash -616498749, now seen corresponding path program 1 times [2023-11-06 23:10:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312528793] [2023-11-06 23:10:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:10:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312528793] [2023-11-06 23:10:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312528793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110450306] [2023-11-06 23:10:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:36,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:36,845 INFO L87 Difference]: Start difference. First operand 5062 states and 6897 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:37,615 INFO L93 Difference]: Finished difference Result 9475 states and 12953 transitions. [2023-11-06 23:10:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 98 [2023-11-06 23:10:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:37,623 INFO L225 Difference]: With dead ends: 9475 [2023-11-06 23:10:37,623 INFO L226 Difference]: Without dead ends: 5046 [2023-11-06 23:10:37,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:37,629 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:37,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2023-11-06 23:10:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 4984. [2023-11-06 23:10:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3457211731619123) internal successors, (6699), 4983 states have internal predecessors, (6699), 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,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6699 transitions. [2023-11-06 23:10:38,103 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6699 transitions. Word has length 98 [2023-11-06 23:10:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6699 transitions. [2023-11-06 23:10:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6699 transitions. [2023-11-06 23:10:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 23:10:38,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2023-11-06 23:10:38,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 23:10:38,107 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:38,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1492177009, now seen corresponding path program 1 times [2023-11-06 23:10:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381978474] [2023-11-06 23:10:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:10:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381978474] [2023-11-06 23:10:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381978474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:38,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061594585] [2023-11-06 23:10:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:38,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:38,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:38,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:38,242 INFO L87 Difference]: Start difference. First operand 4984 states and 6699 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:38,814 INFO L93 Difference]: Finished difference Result 4992 states and 6704 transitions. [2023-11-06 23:10:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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 100 [2023-11-06 23:10:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:38,820 INFO L225 Difference]: With dead ends: 4992 [2023-11-06 23:10:38,821 INFO L226 Difference]: Without dead ends: 4984 [2023-11-06 23:10:38,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:38,823 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 140 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:38,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 441 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2023-11-06 23:10:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4984. [2023-11-06 23:10:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4984 states, 4978 states have (on average 1.3392928887103255) internal successors, (6667), 4983 states have internal predecessors, (6667), 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:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4984 states to 4984 states and 6667 transitions. [2023-11-06 23:10:39,253 INFO L78 Accepts]: Start accepts. Automaton has 4984 states and 6667 transitions. Word has length 100 [2023-11-06 23:10:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:39,253 INFO L495 AbstractCegarLoop]: Abstraction has 4984 states and 6667 transitions. [2023-11-06 23:10:39,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 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:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4984 states and 6667 transitions. [2023-11-06 23:10:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:10:39,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:39,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:39,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 23:10:39,256 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:39,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1356366236, now seen corresponding path program 1 times [2023-11-06 23:10:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242992720] [2023-11-06 23:10:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:39,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242992720] [2023-11-06 23:10:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242992720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:39,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695864519] [2023-11-06 23:10:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:39,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:39,388 INFO L87 Difference]: Start difference. First operand 4984 states and 6667 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:39,945 INFO L93 Difference]: Finished difference Result 6274 states and 8458 transitions. [2023-11-06 23:10:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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 101 [2023-11-06 23:10:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:39,950 INFO L225 Difference]: With dead ends: 6274 [2023-11-06 23:10:39,950 INFO L226 Difference]: Without dead ends: 3603 [2023-11-06 23:10:39,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:39,953 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 127 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:39,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 381 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2023-11-06 23:10:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3201. [2023-11-06 23:10:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3200 states have internal predecessors, (4190), 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,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4190 transitions. [2023-11-06 23:10:40,274 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4190 transitions. Word has length 101 [2023-11-06 23:10:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,274 INFO L495 AbstractCegarLoop]: Abstraction has 3201 states and 4190 transitions. [2023-11-06 23:10:40,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 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,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4190 transitions. [2023-11-06 23:10:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 23:10:40,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 23:10:40,277 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:40,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 852205028, now seen corresponding path program 1 times [2023-11-06 23:10:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668130662] [2023-11-06 23:10:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:10:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668130662] [2023-11-06 23:10:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668130662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572157070] [2023-11-06 23:10:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:40,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,411 INFO L87 Difference]: Start difference. First operand 3201 states and 4190 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,850 INFO L93 Difference]: Finished difference Result 3202 states and 4190 transitions. [2023-11-06 23:10:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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 102 [2023-11-06 23:10:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,854 INFO L225 Difference]: With dead ends: 3202 [2023-11-06 23:10:40,854 INFO L226 Difference]: Without dead ends: 3194 [2023-11-06 23:10:40,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,855 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 366 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2023-11-06 23:10:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2023-11-06 23:10:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.303163169433135) internal successors, (4161), 3193 states have internal predecessors, (4161), 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,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4161 transitions. [2023-11-06 23:10:41,175 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4161 transitions. Word has length 102 [2023-11-06 23:10:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:41,175 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4161 transitions. [2023-11-06 23:10:41,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 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,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4161 transitions. [2023-11-06 23:10:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 23:10:41,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:41,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:41,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 23:10:41,179 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:41,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -902319504, now seen corresponding path program 1 times [2023-11-06 23:10:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:41,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132282316] [2023-11-06 23:10:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132282316] [2023-11-06 23:10:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132282316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733908078] [2023-11-06 23:10:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:41,314 INFO L87 Difference]: Start difference. First operand 3194 states and 4161 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:41,873 INFO L93 Difference]: Finished difference Result 3195 states and 4161 transitions. [2023-11-06 23:10:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 102 [2023-11-06 23:10:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:41,877 INFO L225 Difference]: With dead ends: 3195 [2023-11-06 23:10:41,877 INFO L226 Difference]: Without dead ends: 3194 [2023-11-06 23:10:41,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:41,879 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 117 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:41,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 379 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2023-11-06 23:10:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 3194. [2023-11-06 23:10:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3194 states, 3193 states have (on average 1.3006576886940182) internal successors, (4153), 3193 states have internal predecessors, (4153), 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,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4153 transitions. [2023-11-06 23:10:42,204 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4153 transitions. Word has length 102 [2023-11-06 23:10:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,204 INFO L495 AbstractCegarLoop]: Abstraction has 3194 states and 4153 transitions. [2023-11-06 23:10:42,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4153 transitions. [2023-11-06 23:10:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 23:10:42,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 23:10:42,207 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:42,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 359852434, now seen corresponding path program 1 times [2023-11-06 23:10:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610000954] [2023-11-06 23:10:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:10:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610000954] [2023-11-06 23:10:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610000954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106965026] [2023-11-06 23:10:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:42,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:42,336 INFO L87 Difference]: Start difference. First operand 3194 states and 4153 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,933 INFO L93 Difference]: Finished difference Result 3416 states and 4449 transitions. [2023-11-06 23:10:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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 104 [2023-11-06 23:10:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,936 INFO L225 Difference]: With dead ends: 3416 [2023-11-06 23:10:42,936 INFO L226 Difference]: Without dead ends: 2927 [2023-11-06 23:10:42,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:42,938 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 153 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 495 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2023-11-06 23:10:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2706. [2023-11-06 23:10:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.2913123844731977) internal successors, (3493), 2705 states have internal predecessors, (3493), 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,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3493 transitions. [2023-11-06 23:10:43,265 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3493 transitions. Word has length 104 [2023-11-06 23:10:43,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,265 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 3493 transitions. [2023-11-06 23:10:43,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 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,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3493 transitions. [2023-11-06 23:10:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 23:10:43,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 23:10:43,268 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:43,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1288261038, now seen corresponding path program 2 times [2023-11-06 23:10:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746966052] [2023-11-06 23:10:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:10:43,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746966052] [2023-11-06 23:10:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746966052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38772352] [2023-11-06 23:10:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:43,399 INFO L87 Difference]: Start difference. First operand 2706 states and 3493 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:43,775 INFO L93 Difference]: Finished difference Result 2707 states and 3493 transitions. [2023-11-06 23:10:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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 104 [2023-11-06 23:10:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:43,777 INFO L225 Difference]: With dead ends: 2707 [2023-11-06 23:10:43,778 INFO L226 Difference]: Without dead ends: 1866 [2023-11-06 23:10:43,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:43,779 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 137 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:43,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 485 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2023-11-06 23:10:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2023-11-06 23:10:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.2809651474530832) internal successors, (2389), 1865 states have internal predecessors, (2389), 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,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2389 transitions. [2023-11-06 23:10:43,959 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2389 transitions. Word has length 104 [2023-11-06 23:10:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:43,959 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2389 transitions. [2023-11-06 23:10:43,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 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,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2389 transitions. [2023-11-06 23:10:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 23:10:43,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:43,961 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:43,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-06 23:10:43,962 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-11-06 23:10:43,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1572607299, now seen corresponding path program 1 times [2023-11-06 23:10:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790413297] [2023-11-06 23:10:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 23:10:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790413297] [2023-11-06 23:10:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790413297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077956426] [2023-11-06 23:10:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:44,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:44,139 INFO L87 Difference]: Start difference. First operand 1866 states and 2389 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,448 INFO L93 Difference]: Finished difference Result 1866 states and 2389 transitions. [2023-11-06 23:10:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:44,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 126 [2023-11-06 23:10:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,449 INFO L225 Difference]: With dead ends: 1866 [2023-11-06 23:10:44,449 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:10:44,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:44,451 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 127 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:10:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:10:44,452 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:10:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:10:44,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2023-11-06 23:10:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,453 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:10:44,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:10:44,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:10:44,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2023-11-06 23:10:44,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2023-11-06 23:10:44,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2023-11-06 23:10:44,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2023-11-06 23:10:44,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2023-11-06 23:10:44,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2023-11-06 23:10:44,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2023-11-06 23:10:44,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2023-11-06 23:10:44,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2023-11-06 23:10:44,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 23:10:44,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:10:54,916 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 673 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 23:11:00,360 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 705 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 23:11:07,114 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 733 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 23:11:25,205 WARN L293 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 701 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 23:11:31,136 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 674 DAG size of output: 110 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-06 23:11:40,044 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,044 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2023-11-06 23:11:40,044 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 350) no Hoare annotation was computed. [2023-11-06 23:11:40,044 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2023-11-06 23:11:40,045 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 300) no Hoare annotation was computed. [2023-11-06 23:11:40,045 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2023-11-06 23:11:40,045 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,045 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,046 INFO L895 garLoopResultBuilder]: At program point L170(lines 165 260) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,046 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 345) no Hoare annotation was computed. [2023-11-06 23:11:40,046 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2023-11-06 23:11:40,046 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2023-11-06 23:11:40,046 INFO L899 garLoopResultBuilder]: For program point L336(lines 336 344) no Hoare annotation was computed. [2023-11-06 23:11:40,047 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (let ((.cse5 (= ~st2~0 1)) (.cse6 (= ~st3~0 0)) (.cse2 (= ~st1~0 0)) (.cse4 (= ~st1~0 1)) (.cse0 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse1 (= ~st3~0 1)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0) (and .cse4 .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse6 .cse0 .cse3) (and .cse6 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse3))) [2023-11-06 23:11:40,047 INFO L895 garLoopResultBuilder]: At program point L155(lines 150 305) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,047 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 383) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,047 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,048 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2023-11-06 23:11:40,048 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse4 (= ~st1~0 1)) (.cse2 (= ~st2~0 0)) (.cse0 (= ~st3~0 1)) (.cse6 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse1 (= ~st1~0 0)) (.cse3 (<= (+ (* (div ~r1~0 256) 256) 3) ~r1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2) (and .cse5 .cse1 .cse2) (and .cse4 .cse5 .cse2) (and .cse6 .cse0 .cse1) (and .cse6 .cse5 .cse1 .cse3))) [2023-11-06 23:11:40,048 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2023-11-06 23:11:40,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,049 INFO L895 garLoopResultBuilder]: At program point L140(lines 135 350) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,049 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: (let ((.cse1 (= ~st2~0 1)) (.cse4 (= ~st3~0 0)) (.cse6 (= ~st1~0 0)) (.cse0 (= ~st1~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (= ~st3~0 1)) (.cse5 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse4) (and .cse2 .cse3 .cse6 .cse5) (and .cse1 .cse2 .cse4 .cse6) (and .cse2 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse5))) [2023-11-06 23:11:40,049 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:11:40,049 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,050 INFO L895 garLoopResultBuilder]: At program point L372(lines 360 380) the Hoare annotation is: (let ((.cse4 (= ~st2~0 1)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (= ~st3~0 0)) (.cse5 (= ~st1~0 0)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) (and .cse0 .cse4 .cse1 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse4 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse1 .cse6 .cse5 .cse3))) [2023-11-06 23:11:40,050 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,050 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2023-11-06 23:11:40,050 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,050 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2023-11-06 23:11:40,051 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 381) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,051 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,051 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 299) no Hoare annotation was computed. [2023-11-06 23:11:40,051 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2023-11-06 23:11:40,051 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 469) the Hoare annotation is: true [2023-11-06 23:11:40,051 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,052 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 286) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 355) no Hoare annotation was computed. [2023-11-06 23:11:40,053 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2023-11-06 23:11:40,054 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: (let ((.cse5 (= ~st2~0 1)) (.cse6 (= ~st3~0 0)) (.cse2 (= ~st1~0 0)) (.cse4 (= ~st1~0 1)) (.cse0 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse1 (= ~st3~0 1)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0) (and .cse4 .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse6 .cse0 .cse3) (and .cse6 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse0 .cse1 .cse3))) [2023-11-06 23:11:40,054 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-11-06 23:11:40,054 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:11:40,054 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2023-11-06 23:11:40,054 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2023-11-06 23:11:40,054 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 331) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2023-11-06 23:11:40,055 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2023-11-06 23:11:40,060 INFO L899 garLoopResultBuilder]: For program point L212-4(lines 212 221) no Hoare annotation was computed. [2023-11-06 23:11:40,060 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,061 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2023-11-06 23:11:40,061 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 254) no Hoare annotation was computed. [2023-11-06 23:11:40,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2023-11-06 23:11:40,061 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2023-11-06 23:11:40,061 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 355) the Hoare annotation is: (let ((.cse3 (= ~st2~0 0)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= ~st2~0 1)) (.cse5 (= ~st3~0 0)) (.cse4 (= ~st1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and .cse2 .cse4 .cse3) (and .cse5 .cse4 .cse3) (and .cse0 .cse5 .cse3) (and .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5) (and .cse1 .cse5 .cse4))) [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,063 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 260) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2023-11-06 23:11:40,064 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2023-11-06 23:11:40,065 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2023-11-06 23:11:40,065 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2023-11-06 23:11:40,065 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse1 (= ~st2~0 1)) (.cse4 (= ~st3~0 0)) (.cse6 (= ~st1~0 0)) (.cse0 (= ~st1~0 1)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (= ~st3~0 1)) (.cse5 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse4) (and .cse2 .cse3 .cse6 .cse5) (and .cse1 .cse2 .cse4 .cse6) (and .cse2 .cse4 .cse6 .cse5) (and .cse0 .cse2 .cse3 .cse5))) [2023-11-06 23:11:40,065 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2023-11-06 23:11:40,065 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 305) no Hoare annotation was computed. [2023-11-06 23:11:40,065 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2023-11-06 23:11:40,066 INFO L895 garLoopResultBuilder]: At program point L365(lines 362 375) the Hoare annotation is: (let ((.cse4 (= ~st2~0 1)) (.cse2 (= ~st3~0 1)) (.cse0 (= ~st1~0 1)) (.cse1 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse6 (= ~st3~0 0)) (.cse5 (= ~st1~0 0)) (.cse3 (= ~st2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) (and .cse0 .cse4 .cse1 .cse6) (and .cse1 .cse2 .cse5 .cse3) (and .cse4 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse1 .cse6 .cse5 .cse3))) [2023-11-06 23:11:40,066 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 255) no Hoare annotation was computed. [2023-11-06 23:11:40,069 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 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, 1, 1, 1] [2023-11-06 23:11:40,071 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:11:40,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:11:40 BoogieIcfgContainer [2023-11-06 23:11:40,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:11:40,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:11:40,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:11:40,117 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:11:40,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:09:59" (3/4) ... [2023-11-06 23:11:40,120 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:11:40,133 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-06 23:11:40,134 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:11:40,135 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:11:40,135 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:11:40,274 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:11:40,276 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:11:40,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:11:40,277 INFO L158 Benchmark]: Toolchain (without parser) took 102285.96ms. Allocated memory was 148.9MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 104.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 760.2MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,277 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 148.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:11:40,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.38ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 90.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.38ms. Allocated memory is still 148.9MB. Free memory was 90.9MB in the beginning and 88.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,278 INFO L158 Benchmark]: Boogie Preprocessor took 45.21ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 86.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,279 INFO L158 Benchmark]: RCFGBuilder took 832.63ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 86.8MB in the beginning and 162.4MB in the end (delta: -75.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,279 INFO L158 Benchmark]: TraceAbstraction took 100825.66ms. Allocated memory was 203.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 161.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 23:11:40,279 INFO L158 Benchmark]: Witness Printer took 159.34ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 23:11:40,281 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.33ms. Allocated memory is still 148.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.38ms. Allocated memory is still 148.9MB. Free memory was 104.8MB in the beginning and 90.9MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.38ms. Allocated memory is still 148.9MB. Free memory was 90.9MB in the beginning and 88.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.21ms. Allocated memory is still 148.9MB. Free memory was 88.6MB in the beginning and 86.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 832.63ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 86.8MB in the beginning and 162.4MB in the end (delta: -75.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 100825.66ms. Allocated memory was 203.4MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 161.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 159.34ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 90 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 100.7s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5884 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5884 mSDsluCounter, 11948 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6225 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3016 IncrementalHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 5723 mSDtfsCounter, 3016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9255occurred in iteration=20, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 8001 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 1725 NumberOfFragments, 1631 HoareAnnotationTreeSize, 17 FomulaSimplifications, 896368 FormulaSimplificationTreeSizeReduction, 50.6s HoareSimplificationTime, 17 FomulaSimplificationsInter, 17961 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2525 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 9613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 773/773 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 14 specifications checked. All of them hold - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st2 == 0)) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1))) || ((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st2 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st1 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((256 * (mode3 / 256)) == mode3) && (st3 == 1)) && (st1 == 0)) && (st2 == 0)) || ((((st1 == 1) && (st2 == 1)) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1))) || ((((st2 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st2 == 0))) || ((((st3 == 0) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0))) || ((((st1 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 0)) && (st1 == 0))) || (((((256 * (mode2 / 256)) == mode2) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) || ((((st1 == 1) && ((256 * (mode2 / 256)) == mode2)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((256 * (mode3 / 256)) == mode3) && (st3 == 1)) && (st1 == 0)) && (st2 == 0)) || ((((st1 == 1) && (st2 == 1)) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1))) || ((((st2 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st2 == 0))) || ((((st3 == 0) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && (st3 == 0)) && ((256 * (mode3 / 256)) == mode3)) && (st1 == 0))) || ((((st1 == 1) && ((256 * (mode3 / 256)) == mode3)) && (st3 == 1)) && (st2 == 0))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((st3 == 1) && (st1 == 0)) && (st2 == 0)) && ((((r1 / 256) * 256) + 3) <= r1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || ((((st2 == 1) && (st3 == 0)) && (st1 == 0)) && ((((r1 / 256) * 256) + 3) <= r1))) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st2 == 0)) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 1)) && (st1 == 0)) && (st2 == 0))) || ((((st2 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st1 == 0))) || ((((st1 == 1) && (st2 == 1)) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 1))) || ((((st1 == 1) && ((256 * (mode1 / 256)) == mode1)) && (st3 == 0)) && (st2 == 0))) || (((((256 * (mode1 / 256)) == mode1) && (st3 == 0)) && (st1 == 0)) && (st2 == 0))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:11:40,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_665386a1-e2bf-4b27-97ce-4a123a1856e2/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