./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 840f7211e98f8df944803b1b6b505b147a346af4659f1e24924ab4dd64ebca52 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:08:47,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:08:47,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 13:08:47,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:08:47,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:08:47,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:08:47,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:08:47,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:08:47,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:08:47,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:08:47,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:08:47,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:08:47,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:08:47,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:08:47,641 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:08:47,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:08:47,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:08:47,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:08:47,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:08:47,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:08:47,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:08:47,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:08:47,648 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:08:47,648 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:08:47,648 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:08:47,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:08:47,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:08:47,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:08:47,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:08:47,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:08:47,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:08:47,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:08:47,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:08:47,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:08:47,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:08:47,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:08:47,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:08:47,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:08:47,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:08:47,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:08:47,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:08:47,653 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 840f7211e98f8df944803b1b6b505b147a346af4659f1e24924ab4dd64ebca52 [2024-10-13 13:08:47,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:08:47,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:08:47,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:08:47,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:08:47,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:08:47,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca-2.i [2024-10-13 13:08:49,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:08:49,539 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:08:49,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca-2.i [2024-10-13 13:08:49,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/314b9075e/1c646a8e23de4436bc7c31fce07a8eb2/FLAG58faa38f9 [2024-10-13 13:08:49,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/314b9075e/1c646a8e23de4436bc7c31fce07a8eb2 [2024-10-13 13:08:49,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:08:49,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:08:49,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:08:49,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:08:49,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:08:49,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:49" (1/1) ... [2024-10-13 13:08:49,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c2fff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:49, skipping insertion in model container [2024-10-13 13:08:49,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:08:49" (1/1) ... [2024-10-13 13:08:49,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:08:49,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:08:49,938 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:08:49,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:08:50,016 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:08:50,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50 WrapperNode [2024-10-13 13:08:50,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:08:50,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:08:50,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:08:50,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:08:50,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,060 INFO L138 Inliner]: procedures = 110, calls = 69, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-10-13 13:08:50,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:08:50,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:08:50,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:08:50,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:08:50,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,092 INFO L175 MemorySlicer]: Split 52 memory accesses to 3 slices as follows [44, 4, 4]. 85 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 22 writes are split as follows [18, 2, 2]. [2024-10-13 13:08:50,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:08:50,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:08:50,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:08:50,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:08:50,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (1/1) ... [2024-10-13 13:08:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:08:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:08:50,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 13:08:50,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 13:08:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 13:08:50,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 13:08:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:08:50,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:08:50,370 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:08:50,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:08:50,670 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-10-13 13:08:50,670 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:08:50,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:08:50,706 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 13:08:50,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:50 BoogieIcfgContainer [2024-10-13 13:08:50,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:08:50,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:08:50,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:08:50,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:08:50,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:08:49" (1/3) ... [2024-10-13 13:08:50,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f401075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:50, skipping insertion in model container [2024-10-13 13:08:50,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:08:50" (2/3) ... [2024-10-13 13:08:50,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f401075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:08:50, skipping insertion in model container [2024-10-13 13:08:50,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:50" (3/3) ... [2024-10-13 13:08:50,714 INFO L112 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca-2.i [2024-10-13 13:08:50,729 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:08:50,729 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-10-13 13:08:50,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:08:50,787 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38679b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:08:50,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-10-13 13:08:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 94 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:08:50,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:50,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:08:50,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:50,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 177474213, now seen corresponding path program 1 times [2024-10-13 13:08:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437066163] [2024-10-13 13:08:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437066163] [2024-10-13 13:08:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437066163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:08:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471914494] [2024-10-13 13:08:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:51,169 INFO L87 Difference]: Start difference. First operand has 95 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 94 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:51,312 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2024-10-13 13:08:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:08:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:51,323 INFO L225 Difference]: With dead ends: 188 [2024-10-13 13:08:51,323 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 13:08:51,326 INFO L431 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 [2024-10-13 13:08:51,330 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 5 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:51,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 258 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 13:08:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-10-13 13:08:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 94 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) [2024-10-13 13:08:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-10-13 13:08:51,377 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 5 [2024-10-13 13:08:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:51,377 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-10-13 13:08:51,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-10-13 13:08:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:08:51,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:51,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:08:51,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:08:51,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:51,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 177474021, now seen corresponding path program 1 times [2024-10-13 13:08:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782864517] [2024-10-13 13:08:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782864517] [2024-10-13 13:08:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782864517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:51,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046612053] [2024-10-13 13:08:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:51,519 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:51,653 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-10-13 13:08:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:08:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:51,655 INFO L225 Difference]: With dead ends: 95 [2024-10-13 13:08:51,656 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 13:08:51,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:51,659 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:51,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 247 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 13:08:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 13:08:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-10-13 13:08:51,667 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 5 [2024-10-13 13:08:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:51,667 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-10-13 13:08:51,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-10-13 13:08:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 13:08:51,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:51,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 13:08:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:08:51,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 177533795, now seen corresponding path program 1 times [2024-10-13 13:08:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065461008] [2024-10-13 13:08:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065461008] [2024-10-13 13:08:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065461008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:08:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815556412] [2024-10-13 13:08:51,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:51,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:08:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:51,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:08:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:08:51,834 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:51,960 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2024-10-13 13:08:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:08:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 13:08:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:51,964 INFO L225 Difference]: With dead ends: 178 [2024-10-13 13:08:51,964 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 13:08:51,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:08:51,965 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:51,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 13:08:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 13:08:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 13:08:51,977 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 5 [2024-10-13 13:08:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:51,977 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 13:08:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 13:08:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 13:08:51,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:51,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 13:08:51,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 13:08:51,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1206727401, now seen corresponding path program 1 times [2024-10-13 13:08:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499265654] [2024-10-13 13:08:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499265654] [2024-10-13 13:08:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499265654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:08:52,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110638141] [2024-10-13 13:08:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:08:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:52,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:08:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:08:52,110 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:52,186 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-13 13:08:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:08:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 13:08:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:52,187 INFO L225 Difference]: With dead ends: 93 [2024-10-13 13:08:52,187 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:08:52,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:08:52,189 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:52,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:08:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 13:08:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 13:08:52,200 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 6 [2024-10-13 13:08:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:52,201 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 13:08:52,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 13:08:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 13:08:52,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:52,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 13:08:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:08:52,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1208580401, now seen corresponding path program 1 times [2024-10-13 13:08:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:52,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734557666] [2024-10-13 13:08:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734557666] [2024-10-13 13:08:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734557666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646785348] [2024-10-13 13:08:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:52,263 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:52,325 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-13 13:08:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:52,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 13:08:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:52,327 INFO L225 Difference]: With dead ends: 92 [2024-10-13 13:08:52,327 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 13:08:52,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:52,328 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:52,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 13:08:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 13:08:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.694915254237288) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-13 13:08:52,339 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 6 [2024-10-13 13:08:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:52,339 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-13 13:08:52,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-13 13:08:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:08:52,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:52,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:52,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 13:08:52,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 739789583, now seen corresponding path program 1 times [2024-10-13 13:08:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146724344] [2024-10-13 13:08:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146724344] [2024-10-13 13:08:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146724344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:52,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:08:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908393184] [2024-10-13 13:08:52,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:52,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:08:52,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:08:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:52,521 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:52,623 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2024-10-13 13:08:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:08:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:08:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:52,626 INFO L225 Difference]: With dead ends: 172 [2024-10-13 13:08:52,626 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 13:08:52,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:52,628 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:52,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 377 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 13:08:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-13 13:08:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 13:08:52,634 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 9 [2024-10-13 13:08:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:52,634 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 13:08:52,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 13:08:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:08:52,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:52,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:52,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:08:52,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 739789391, now seen corresponding path program 1 times [2024-10-13 13:08:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376512994] [2024-10-13 13:08:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376512994] [2024-10-13 13:08:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376512994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563978850] [2024-10-13 13:08:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:52,683 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:52,745 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-13 13:08:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:08:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:52,746 INFO L225 Difference]: With dead ends: 93 [2024-10-13 13:08:52,747 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:08:52,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:52,748 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:52,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 235 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:08:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 13:08:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 13:08:52,755 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 9 [2024-10-13 13:08:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:52,755 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 13:08:52,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 13:08:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:08:52,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:52,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:08:52,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:52,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 107937735, now seen corresponding path program 1 times [2024-10-13 13:08:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278633964] [2024-10-13 13:08:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278633964] [2024-10-13 13:08:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278633964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:08:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772558755] [2024-10-13 13:08:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:52,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:08:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:08:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:52,915 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:53,018 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-10-13 13:08:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:08:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 13:08:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:53,019 INFO L225 Difference]: With dead ends: 95 [2024-10-13 13:08:53,019 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 13:08:53,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:08:53,020 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 14 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:53,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 318 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 13:08:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-10-13 13:08:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.639344262295082) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-13 13:08:53,026 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 9 [2024-10-13 13:08:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:53,026 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-13 13:08:53,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-13 13:08:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:08:53,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:53,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:53,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:08:53,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:53,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1458634702, now seen corresponding path program 1 times [2024-10-13 13:08:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909767365] [2024-10-13 13:08:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:53,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909767365] [2024-10-13 13:08:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909767365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:53,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 13:08:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515765312] [2024-10-13 13:08:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:53,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:08:53,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:53,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:08:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:08:53,192 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:53,347 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-10-13 13:08:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 13:08:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:08:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:53,348 INFO L225 Difference]: With dead ends: 94 [2024-10-13 13:08:53,348 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 13:08:53,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:08:53,349 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:53,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 408 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 13:08:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-13 13:08:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.619047619047619) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 13:08:53,361 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2024-10-13 13:08:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 13:08:53,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 13:08:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:08:53,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:53,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 13:08:53,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -948897444, now seen corresponding path program 1 times [2024-10-13 13:08:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:53,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388836983] [2024-10-13 13:08:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388836983] [2024-10-13 13:08:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388836983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576447385] [2024-10-13 13:08:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:53,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:53,440 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:53,493 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-13 13:08:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:08:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:53,495 INFO L225 Difference]: With dead ends: 93 [2024-10-13 13:08:53,495 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:08:53,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:53,497 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:53,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:08:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 13:08:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 13:08:53,506 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2024-10-13 13:08:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:53,506 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 13:08:53,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 13:08:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 13:08:53,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:53,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:53,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:08:53,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:53,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:53,508 INFO L85 PathProgramCache]: Analyzing trace with hash -948903402, now seen corresponding path program 1 times [2024-10-13 13:08:53,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:53,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172140317] [2024-10-13 13:08:53,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:53,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:53,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172140317] [2024-10-13 13:08:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172140317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:53,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 13:08:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569255264] [2024-10-13 13:08:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 13:08:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:53,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 13:08:53,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:08:53,658 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:53,822 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2024-10-13 13:08:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:08:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 13:08:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:53,823 INFO L225 Difference]: With dead ends: 163 [2024-10-13 13:08:53,823 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 13:08:53,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:08:53,824 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:53,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 13:08:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 13:08:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 88 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) [2024-10-13 13:08:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-10-13 13:08:53,830 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 10 [2024-10-13 13:08:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:53,830 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-10-13 13:08:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-10-13 13:08:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:08:53,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:53,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:53,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 13:08:53,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2002342457, now seen corresponding path program 1 times [2024-10-13 13:08:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126535401] [2024-10-13 13:08:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:53,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126535401] [2024-10-13 13:08:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126535401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:08:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12221500] [2024-10-13 13:08:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:08:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:08:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:08:53,934 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:54,036 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-13 13:08:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:08:54,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 13:08:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:54,039 INFO L225 Difference]: With dead ends: 99 [2024-10-13 13:08:54,040 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 13:08:54,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:54,040 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:54,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 344 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 13:08:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2024-10-13 13:08:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.578125) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-13 13:08:54,044 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 13 [2024-10-13 13:08:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:54,044 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-13 13:08:54,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-13 13:08:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:08:54,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:54,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:54,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 13:08:54,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2002342265, now seen corresponding path program 1 times [2024-10-13 13:08:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:54,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163005122] [2024-10-13 13:08:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:54,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163005122] [2024-10-13 13:08:54,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163005122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:54,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517819894] [2024-10-13 13:08:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:54,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:54,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:54,097 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:54,152 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-13 13:08:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 13:08:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:54,153 INFO L225 Difference]: With dead ends: 92 [2024-10-13 13:08:54,153 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 13:08:54,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:54,154 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:54,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 13:08:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-13 13:08:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.5625) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-10-13 13:08:54,158 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2024-10-13 13:08:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:54,158 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-10-13 13:08:54,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-10-13 13:08:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:08:54,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:54,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:54,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 13:08:54,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:54,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash 871056875, now seen corresponding path program 1 times [2024-10-13 13:08:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426502846] [2024-10-13 13:08:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426502846] [2024-10-13 13:08:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426502846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:54,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 13:08:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243028526] [2024-10-13 13:08:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:54,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:08:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:54,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:08:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:08:54,321 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:54,489 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-13 13:08:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 13:08:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 13:08:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:54,490 INFO L225 Difference]: With dead ends: 96 [2024-10-13 13:08:54,491 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 13:08:54,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:08:54,491 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:54,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 13:08:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-10-13 13:08:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 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) [2024-10-13 13:08:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-13 13:08:54,495 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2024-10-13 13:08:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:54,495 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-13 13:08:54,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-13 13:08:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:08:54,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:54,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:54,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 13:08:54,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:54,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1943074105, now seen corresponding path program 1 times [2024-10-13 13:08:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102162558] [2024-10-13 13:08:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:54,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102162558] [2024-10-13 13:08:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102162558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80604517] [2024-10-13 13:08:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:54,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:54,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:54,546 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:54,597 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-13 13:08:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 13:08:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:54,599 INFO L225 Difference]: With dead ends: 87 [2024-10-13 13:08:54,599 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 13:08:54,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:54,599 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:54,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 13:08:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 13:08:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-13 13:08:54,604 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 14 [2024-10-13 13:08:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-13 13:08:54,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-13 13:08:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:08:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:54,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:54,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 13:08:54,605 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:54,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1943068147, now seen corresponding path program 1 times [2024-10-13 13:08:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27225615] [2024-10-13 13:08:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:54,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27225615] [2024-10-13 13:08:54,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27225615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:54,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:54,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 13:08:54,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478349172] [2024-10-13 13:08:54,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:54,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 13:08:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:54,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 13:08:54,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 13:08:54,793 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:54,941 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-10-13 13:08:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:08:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 13:08:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:54,943 INFO L225 Difference]: With dead ends: 93 [2024-10-13 13:08:54,943 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:08:54,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:08:54,943 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:54,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 393 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:08:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-13 13:08:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 89 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-10-13 13:08:54,947 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 14 [2024-10-13 13:08:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:54,947 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-10-13 13:08:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-10-13 13:08:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 13:08:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:54,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 13:08:54,948 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:54,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1232953473, now seen corresponding path program 1 times [2024-10-13 13:08:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055211982] [2024-10-13 13:08:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:55,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055211982] [2024-10-13 13:08:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055211982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:55,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 13:08:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177742249] [2024-10-13 13:08:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:55,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:08:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:08:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:08:55,143 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:55,352 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-10-13 13:08:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:08:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 13:08:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:55,353 INFO L225 Difference]: With dead ends: 102 [2024-10-13 13:08:55,353 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 13:08:55,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:08:55,354 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 17 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:55,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 564 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:08:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 13:08:55,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2024-10-13 13:08:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 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) [2024-10-13 13:08:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-10-13 13:08:55,357 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2024-10-13 13:08:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-10-13 13:08:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-10-13 13:08:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:08:55,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:55,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 13:08:55,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1448469923, now seen corresponding path program 1 times [2024-10-13 13:08:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653218267] [2024-10-13 13:08:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653218267] [2024-10-13 13:08:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653218267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723367283] [2024-10-13 13:08:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:55,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:55,403 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:55,453 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-10-13 13:08:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:55,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:08:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:55,454 INFO L225 Difference]: With dead ends: 85 [2024-10-13 13:08:55,454 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 13:08:55,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:55,455 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:55,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 13:08:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 13:08:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 83 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) [2024-10-13 13:08:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-10-13 13:08:55,457 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 17 [2024-10-13 13:08:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-10-13 13:08:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-10-13 13:08:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:08:55,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:55,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:55,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 13:08:55,460 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1448469731, now seen corresponding path program 1 times [2024-10-13 13:08:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779260874] [2024-10-13 13:08:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779260874] [2024-10-13 13:08:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779260874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:08:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735948028] [2024-10-13 13:08:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:08:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:08:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:08:55,565 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:55,665 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2024-10-13 13:08:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:08:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:08:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:55,667 INFO L225 Difference]: With dead ends: 150 [2024-10-13 13:08:55,667 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 13:08:55,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:08:55,668 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:55,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 13:08:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-13 13:08:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.492063492063492) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-13 13:08:55,670 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2024-10-13 13:08:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:55,670 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-13 13:08:55,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-13 13:08:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:08:55,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:55,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 13:08:55,672 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:55,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1625964509, now seen corresponding path program 1 times [2024-10-13 13:08:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:55,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955041393] [2024-10-13 13:08:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955041393] [2024-10-13 13:08:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955041393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:55,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 13:08:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874611218] [2024-10-13 13:08:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:55,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:08:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:08:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:08:55,905 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:56,041 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2024-10-13 13:08:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 13:08:56,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:08:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:56,042 INFO L225 Difference]: With dead ends: 148 [2024-10-13 13:08:56,042 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 13:08:56,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:08:56,043 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:56,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 454 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 13:08:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-13 13:08:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.462686567164179) internal successors, (98), 89 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) [2024-10-13 13:08:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-10-13 13:08:56,048 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 17 [2024-10-13 13:08:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:56,048 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-10-13 13:08:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-10-13 13:08:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:08:56,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:56,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 13:08:56,049 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 534177231, now seen corresponding path program 1 times [2024-10-13 13:08:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164223553] [2024-10-13 13:08:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164223553] [2024-10-13 13:08:56,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164223553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:56,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 13:08:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515718114] [2024-10-13 13:08:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:56,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 13:08:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 13:08:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 13:08:56,291 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:56,470 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-10-13 13:08:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:08:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:08:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:56,471 INFO L225 Difference]: With dead ends: 99 [2024-10-13 13:08:56,471 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 13:08:56,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:08:56,472 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:56,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 468 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 13:08:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-10-13 13:08:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-10-13 13:08:56,474 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 17 [2024-10-13 13:08:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:56,475 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-10-13 13:08:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-10-13 13:08:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 13:08:56,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:56,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:56,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 13:08:56,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 356682453, now seen corresponding path program 1 times [2024-10-13 13:08:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:56,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104776769] [2024-10-13 13:08:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104776769] [2024-10-13 13:08:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104776769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:56,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 13:08:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265053683] [2024-10-13 13:08:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:56,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 13:08:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 13:08:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:08:56,640 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:56,754 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2024-10-13 13:08:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 13:08:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 13:08:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:56,755 INFO L225 Difference]: With dead ends: 149 [2024-10-13 13:08:56,755 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 13:08:56,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:08:56,756 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:56,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 402 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 13:08:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 13:08:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-10-13 13:08:56,759 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 17 [2024-10-13 13:08:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:56,759 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-10-13 13:08:56,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-10-13 13:08:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:08:56,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:56,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 13:08:56,760 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:56,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:56,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1134701912, now seen corresponding path program 1 times [2024-10-13 13:08:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727536866] [2024-10-13 13:08:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:56,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727536866] [2024-10-13 13:08:56,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727536866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:56,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:56,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 13:08:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040666417] [2024-10-13 13:08:56,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:56,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 13:08:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 13:08:56,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-13 13:08:56,999 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:57,183 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-10-13 13:08:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:08:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 13:08:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:57,184 INFO L225 Difference]: With dead ends: 90 [2024-10-13 13:08:57,184 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 13:08:57,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:08:57,185 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:57,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 510 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 13:08:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 13:08:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 88 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) [2024-10-13 13:08:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-10-13 13:08:57,188 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 18 [2024-10-13 13:08:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-10-13 13:08:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-10-13 13:08:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:08:57,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:57,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 13:08:57,189 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -620380884, now seen corresponding path program 1 times [2024-10-13 13:08:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287943040] [2024-10-13 13:08:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287943040] [2024-10-13 13:08:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287943040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:57,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 13:08:57,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704136196] [2024-10-13 13:08:57,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 13:08:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 13:08:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 13:08:57,425 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:57,611 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2024-10-13 13:08:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 13:08:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 13:08:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:57,612 INFO L225 Difference]: With dead ends: 140 [2024-10-13 13:08:57,612 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 13:08:57,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:08:57,613 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:57,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 537 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:08:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 13:08:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 13:08:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 85 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) [2024-10-13 13:08:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-10-13 13:08:57,616 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 18 [2024-10-13 13:08:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:57,616 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-10-13 13:08:57,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-10-13 13:08:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:08:57,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:57,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:57,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 13:08:57,617 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -620374926, now seen corresponding path program 1 times [2024-10-13 13:08:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385787507] [2024-10-13 13:08:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385787507] [2024-10-13 13:08:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385787507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278678002] [2024-10-13 13:08:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:57,656 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:57,716 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-10-13 13:08:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:57,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-13 13:08:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:57,717 INFO L225 Difference]: With dead ends: 86 [2024-10-13 13:08:57,717 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 13:08:57,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:57,718 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:57,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 13:08:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 13:08:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4) internal successors, (91), 84 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) [2024-10-13 13:08:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-10-13 13:08:57,720 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 18 [2024-10-13 13:08:57,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:57,720 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-10-13 13:08:57,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-10-13 13:08:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 13:08:57,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:57,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:57,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 13:08:57,721 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:57,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:57,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1782828019, now seen corresponding path program 1 times [2024-10-13 13:08:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549481141] [2024-10-13 13:08:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549481141] [2024-10-13 13:08:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549481141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:57,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:57,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122800679] [2024-10-13 13:08:57,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:57,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:57,763 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:57,815 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-10-13 13:08:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 13:08:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:57,816 INFO L225 Difference]: With dead ends: 85 [2024-10-13 13:08:57,816 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 13:08:57,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:57,817 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:57,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 199 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 13:08:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 13:08:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 83 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) [2024-10-13 13:08:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-10-13 13:08:57,820 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 21 [2024-10-13 13:08:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-10-13 13:08:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-10-13 13:08:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 13:08:57,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:57,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:57,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 13:08:57,821 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1782827827, now seen corresponding path program 1 times [2024-10-13 13:08:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017238105] [2024-10-13 13:08:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:57,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017238105] [2024-10-13 13:08:57,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017238105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:57,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:57,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:08:57,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840042094] [2024-10-13 13:08:57,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:57,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:08:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:08:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:57,913 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:58,020 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2024-10-13 13:08:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:08:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 13:08:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:58,021 INFO L225 Difference]: With dead ends: 134 [2024-10-13 13:08:58,021 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 13:08:58,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:58,022 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:58,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 349 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 13:08:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-13 13:08:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.373134328358209) internal successors, (92), 85 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) [2024-10-13 13:08:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-10-13 13:08:58,024 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 21 [2024-10-13 13:08:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-10-13 13:08:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-10-13 13:08:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 13:08:58,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:58,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:08:58,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 13:08:58,025 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:58,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:58,025 INFO L85 PathProgramCache]: Analyzing trace with hash -345047181, now seen corresponding path program 1 times [2024-10-13 13:08:58,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655510510] [2024-10-13 13:08:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:58,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:58,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655510510] [2024-10-13 13:08:58,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655510510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:58,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:58,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 13:08:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430904713] [2024-10-13 13:08:58,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:58,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 13:08:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 13:08:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:08:58,340 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:58,576 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-10-13 13:08:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 13:08:58,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 13:08:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:58,577 INFO L225 Difference]: With dead ends: 89 [2024-10-13 13:08:58,578 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 13:08:58,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-10-13 13:08:58,578 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:58,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 516 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:08:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 13:08:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-10-13 13:08:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 84 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) [2024-10-13 13:08:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-10-13 13:08:58,582 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 21 [2024-10-13 13:08:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:58,582 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-10-13 13:08:58,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-10-13 13:08:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 13:08:58,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:58,583 INFO L215 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] [2024-10-13 13:08:58,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 13:08:58,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:58,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 566906365, now seen corresponding path program 1 times [2024-10-13 13:08:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9396599] [2024-10-13 13:08:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:58,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9396599] [2024-10-13 13:08:58,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9396599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 13:08:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435912102] [2024-10-13 13:08:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:58,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 13:08:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 13:08:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-13 13:08:58,883 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:59,083 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-10-13 13:08:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 13:08:59,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 13:08:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:59,084 INFO L225 Difference]: With dead ends: 88 [2024-10-13 13:08:59,084 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 13:08:59,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-10-13 13:08:59,086 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:59,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 444 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 13:08:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 13:08:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 86 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) [2024-10-13 13:08:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-10-13 13:08:59,089 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 22 [2024-10-13 13:08:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:59,089 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-10-13 13:08:59,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-10-13 13:08:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 13:08:59,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:59,090 INFO L215 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] [2024-10-13 13:08:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 13:08:59,091 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2106533865, now seen corresponding path program 1 times [2024-10-13 13:08:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:59,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527685149] [2024-10-13 13:08:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:59,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527685149] [2024-10-13 13:08:59,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527685149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:59,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:59,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 13:08:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584030950] [2024-10-13 13:08:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:59,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:08:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:59,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:08:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-13 13:08:59,378 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:59,559 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-10-13 13:08:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 13:08:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 13:08:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:59,560 INFO L225 Difference]: With dead ends: 128 [2024-10-13 13:08:59,560 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 13:08:59,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:08:59,561 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:59,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 516 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 13:08:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 13:08:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.328358208955224) internal successors, (89), 83 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) [2024-10-13 13:08:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-13 13:08:59,564 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 22 [2024-10-13 13:08:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:59,564 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-13 13:08:59,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-13 13:08:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 13:08:59,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:59,565 INFO L215 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] [2024-10-13 13:08:59,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 13:08:59,565 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:59,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2106527907, now seen corresponding path program 1 times [2024-10-13 13:08:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137595680] [2024-10-13 13:08:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:59,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137595680] [2024-10-13 13:08:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137595680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:59,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518150313] [2024-10-13 13:08:59,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:59,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:59,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:59,609 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:59,657 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-13 13:08:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 13:08:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:59,659 INFO L225 Difference]: With dead ends: 84 [2024-10-13 13:08:59,659 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 13:08:59,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:59,659 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:59,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 13:08:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 13:08:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-13 13:08:59,662 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 22 [2024-10-13 13:08:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:59,662 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-13 13:08:59,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-13 13:08:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:08:59,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:59,663 INFO L215 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] [2024-10-13 13:08:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 13:08:59,664 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 896225143, now seen corresponding path program 1 times [2024-10-13 13:08:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105703437] [2024-10-13 13:08:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105703437] [2024-10-13 13:08:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105703437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:59,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:59,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:08:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100363623] [2024-10-13 13:08:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:08:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:08:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:59,725 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:59,775 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-13 13:08:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:08:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 13:08:59,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:59,776 INFO L225 Difference]: With dead ends: 83 [2024-10-13 13:08:59,776 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 13:08:59,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:08:59,777 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:59,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 187 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:08:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 13:08:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 13:08:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-10-13 13:08:59,780 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 25 [2024-10-13 13:08:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-10-13 13:08:59,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-10-13 13:08:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:08:59,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:59,781 INFO L215 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] [2024-10-13 13:08:59,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 13:08:59,782 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:59,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 896225335, now seen corresponding path program 1 times [2024-10-13 13:08:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281574393] [2024-10-13 13:08:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:08:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:08:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:08:59,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281574393] [2024-10-13 13:08:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281574393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:08:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:08:59,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:08:59,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795890131] [2024-10-13 13:08:59,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:08:59,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:08:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:08:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:08:59,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:59,873 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:08:59,979 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-10-13 13:08:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:08:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 13:08:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:08:59,980 INFO L225 Difference]: With dead ends: 122 [2024-10-13 13:08:59,980 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 13:08:59,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:08:59,980 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:08:59,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 325 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:08:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 13:08:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-13 13:08:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 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) [2024-10-13 13:08:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-13 13:08:59,983 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 25 [2024-10-13 13:08:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:08:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-13 13:08:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:08:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-13 13:08:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:08:59,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:08:59,984 INFO L215 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] [2024-10-13 13:08:59,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 13:08:59,985 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:08:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:08:59,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1805602089, now seen corresponding path program 1 times [2024-10-13 13:08:59,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:08:59,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259103606] [2024-10-13 13:08:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:08:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:08:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:00,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:00,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259103606] [2024-10-13 13:09:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259103606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:00,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 13:09:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706369738] [2024-10-13 13:09:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:00,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 13:09:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 13:09:00,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-10-13 13:09:00,333 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:00,650 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-13 13:09:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 13:09:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 13:09:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:00,651 INFO L225 Difference]: With dead ends: 87 [2024-10-13 13:09:00,651 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 13:09:00,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:09:00,653 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 39 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:00,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 575 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 13:09:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-10-13 13:09:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-13 13:09:00,655 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2024-10-13 13:09:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:00,655 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-13 13:09:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-13 13:09:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 13:09:00,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:00,656 INFO L215 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] [2024-10-13 13:09:00,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 13:09:00,656 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2013175778, now seen corresponding path program 1 times [2024-10-13 13:09:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609039500] [2024-10-13 13:09:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609039500] [2024-10-13 13:09:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609039500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 13:09:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256259580] [2024-10-13 13:09:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:01,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 13:09:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 13:09:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-13 13:09:01,037 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:01,290 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-13 13:09:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 13:09:01,290 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 13:09:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:01,291 INFO L225 Difference]: With dead ends: 86 [2024-10-13 13:09:01,291 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 13:09:01,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:09:01,292 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 39 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:01,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 470 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 13:09:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 13:09:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 71 states have (on average 1.267605633802817) internal successors, (90), 84 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) [2024-10-13 13:09:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-10-13 13:09:01,294 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 26 [2024-10-13 13:09:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:01,294 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-10-13 13:09:01,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-10-13 13:09:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 13:09:01,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:01,295 INFO L215 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] [2024-10-13 13:09:01,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 13:09:01,295 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:01,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash -139095742, now seen corresponding path program 1 times [2024-10-13 13:09:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851221307] [2024-10-13 13:09:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:01,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:01,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851221307] [2024-10-13 13:09:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851221307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-13 13:09:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209128574] [2024-10-13 13:09:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 13:09:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:01,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 13:09:01,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-10-13 13:09:01,713 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:01,977 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-10-13 13:09:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 13:09:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 13:09:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:01,978 INFO L225 Difference]: With dead ends: 116 [2024-10-13 13:09:01,978 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 13:09:01,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-10-13 13:09:01,979 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 27 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:01,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 527 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 13:09:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 13:09:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-13 13:09:01,986 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 26 [2024-10-13 13:09:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-13 13:09:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-13 13:09:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 13:09:01,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:01,988 INFO L215 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] [2024-10-13 13:09:01,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 13:09:01,988 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:01,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash -139089784, now seen corresponding path program 1 times [2024-10-13 13:09:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897125779] [2024-10-13 13:09:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:02,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:02,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897125779] [2024-10-13 13:09:02,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897125779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:02,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:02,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:09:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693715458] [2024-10-13 13:09:02,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:02,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:09:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:09:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:02,047 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:02,101 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-10-13 13:09:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:09:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 13:09:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:02,102 INFO L225 Difference]: With dead ends: 82 [2024-10-13 13:09:02,102 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 13:09:02,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:02,104 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:02,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:09:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 13:09:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 13:09:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 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) [2024-10-13 13:09:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-13 13:09:02,107 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 26 [2024-10-13 13:09:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-13 13:09:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-13 13:09:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 13:09:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:02,108 INFO L215 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] [2024-10-13 13:09:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 13:09:02,109 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -403590751, now seen corresponding path program 1 times [2024-10-13 13:09:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631769850] [2024-10-13 13:09:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631769850] [2024-10-13 13:09:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631769850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:02,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:09:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958541292] [2024-10-13 13:09:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:02,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:09:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:09:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:02,168 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:02,219 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-13 13:09:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:09:02,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 13:09:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:02,220 INFO L225 Difference]: With dead ends: 81 [2024-10-13 13:09:02,220 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 13:09:02,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:02,221 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:02,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:09:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 13:09:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 13:09:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-13 13:09:02,223 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 29 [2024-10-13 13:09:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-13 13:09:02,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-13 13:09:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 13:09:02,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:02,225 INFO L215 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] [2024-10-13 13:09:02,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-13 13:09:02,225 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash -403590559, now seen corresponding path program 1 times [2024-10-13 13:09:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008685830] [2024-10-13 13:09:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008685830] [2024-10-13 13:09:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008685830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 13:09:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076253439] [2024-10-13 13:09:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:09:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:02,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:09:02,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:09:02,321 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:02,404 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-13 13:09:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:09:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 13:09:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:02,405 INFO L225 Difference]: With dead ends: 110 [2024-10-13 13:09:02,405 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 13:09:02,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:09:02,406 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:02,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 271 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:09:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 13:09:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-13 13:09:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-13 13:09:02,407 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 29 [2024-10-13 13:09:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:02,408 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-13 13:09:02,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-13 13:09:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 13:09:02,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:02,408 INFO L215 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] [2024-10-13 13:09:02,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-13 13:09:02,409 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:02,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1019813883, now seen corresponding path program 1 times [2024-10-13 13:09:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894332987] [2024-10-13 13:09:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894332987] [2024-10-13 13:09:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894332987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:02,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-13 13:09:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669088654] [2024-10-13 13:09:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:02,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 13:09:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 13:09:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-10-13 13:09:02,841 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:03,154 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-10-13 13:09:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 13:09:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 13:09:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:03,155 INFO L225 Difference]: With dead ends: 85 [2024-10-13 13:09:03,155 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 13:09:03,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-10-13 13:09:03,156 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:03,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 534 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 13:09:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-10-13 13:09:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 80 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) [2024-10-13 13:09:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-13 13:09:03,158 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 29 [2024-10-13 13:09:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:03,159 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-13 13:09:03,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-13 13:09:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:09:03,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:03,159 INFO L215 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] [2024-10-13 13:09:03,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-13 13:09:03,160 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:03,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash 373588743, now seen corresponding path program 1 times [2024-10-13 13:09:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:03,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108142140] [2024-10-13 13:09:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108142140] [2024-10-13 13:09:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108142140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-13 13:09:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67552076] [2024-10-13 13:09:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:03,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 13:09:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 13:09:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:09:03,626 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:03,863 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-10-13 13:09:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 13:09:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-13 13:09:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:03,864 INFO L225 Difference]: With dead ends: 84 [2024-10-13 13:09:03,864 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 13:09:03,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2024-10-13 13:09:03,865 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:03,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 446 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 13:09:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 13:09:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 82 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2024-10-13 13:09:03,867 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2024-10-13 13:09:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:03,867 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2024-10-13 13:09:03,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2024-10-13 13:09:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:09:03,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:03,868 INFO L215 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] [2024-10-13 13:09:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-13 13:09:03,869 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:03,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1549453485, now seen corresponding path program 1 times [2024-10-13 13:09:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255134412] [2024-10-13 13:09:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:04,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:04,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255134412] [2024-10-13 13:09:04,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255134412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:04,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:04,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-13 13:09:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549488703] [2024-10-13 13:09:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:04,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 13:09:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:04,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 13:09:04,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-10-13 13:09:04,298 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:04,644 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-10-13 13:09:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 13:09:04,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-13 13:09:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:04,645 INFO L225 Difference]: With dead ends: 93 [2024-10-13 13:09:04,645 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 13:09:04,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2024-10-13 13:09:04,646 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:04,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 638 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:09:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 13:09:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-13 13:09:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-13 13:09:04,648 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 30 [2024-10-13 13:09:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:04,648 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-13 13:09:04,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-13 13:09:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 13:09:04,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:04,649 INFO L215 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] [2024-10-13 13:09:04,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-13 13:09:04,649 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1549459443, now seen corresponding path program 1 times [2024-10-13 13:09:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:04,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937294729] [2024-10-13 13:09:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:04,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937294729] [2024-10-13 13:09:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937294729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:09:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809479890] [2024-10-13 13:09:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:04,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:09:04,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:04,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:09:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:04,695 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:04,740 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-13 13:09:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:09:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-13 13:09:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:04,741 INFO L225 Difference]: With dead ends: 80 [2024-10-13 13:09:04,741 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 13:09:04,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:04,741 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:04,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:09:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 13:09:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 13:09:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-13 13:09:04,747 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 30 [2024-10-13 13:09:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:04,747 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-13 13:09:04,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-13 13:09:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:09:04,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:04,748 INFO L215 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] [2024-10-13 13:09:04,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-13 13:09:04,748 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1322121867, now seen corresponding path program 1 times [2024-10-13 13:09:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953829066] [2024-10-13 13:09:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953829066] [2024-10-13 13:09:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953829066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:09:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014236398] [2024-10-13 13:09:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:09:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:09:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:04,795 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:04,839 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-13 13:09:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:09:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-13 13:09:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:04,840 INFO L225 Difference]: With dead ends: 79 [2024-10-13 13:09:04,840 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 13:09:04,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:04,841 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:04,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:09:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 13:09:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 13:09:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-13 13:09:04,843 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 33 [2024-10-13 13:09:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:04,844 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-13 13:09:04,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-13 13:09:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:09:04,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:04,845 INFO L215 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] [2024-10-13 13:09:04,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-13 13:09:04,845 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1322122059, now seen corresponding path program 1 times [2024-10-13 13:09:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684623223] [2024-10-13 13:09:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684623223] [2024-10-13 13:09:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684623223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-13 13:09:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057288447] [2024-10-13 13:09:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 13:09:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 13:09:05,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-13 13:09:05,313 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:05,567 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-10-13 13:09:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 13:09:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-13 13:09:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:05,568 INFO L225 Difference]: With dead ends: 100 [2024-10-13 13:09:05,568 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 13:09:05,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2024-10-13 13:09:05,569 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:05,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 491 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 13:09:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-13 13:09:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-13 13:09:05,573 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 33 [2024-10-13 13:09:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:05,574 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-13 13:09:05,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-13 13:09:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:09:05,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:05,575 INFO L215 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] [2024-10-13 13:09:05,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-13 13:09:05,575 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1755384805, now seen corresponding path program 1 times [2024-10-13 13:09:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555112829] [2024-10-13 13:09:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555112829] [2024-10-13 13:09:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555112829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:06,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-13 13:09:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011363302] [2024-10-13 13:09:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:06,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 13:09:06,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 13:09:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-13 13:09:06,015 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:06,219 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-10-13 13:09:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 13:09:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-13 13:09:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:06,220 INFO L225 Difference]: With dead ends: 102 [2024-10-13 13:09:06,220 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 13:09:06,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2024-10-13 13:09:06,220 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:06,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 464 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 13:09:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 13:09:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-10-13 13:09:06,222 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 33 [2024-10-13 13:09:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-10-13 13:09:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-10-13 13:09:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 13:09:06,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:06,223 INFO L215 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] [2024-10-13 13:09:06,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-13 13:09:06,224 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1932879583, now seen corresponding path program 1 times [2024-10-13 13:09:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275504850] [2024-10-13 13:09:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275504850] [2024-10-13 13:09:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275504850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-13 13:09:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658183083] [2024-10-13 13:09:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 13:09:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 13:09:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:09:06,718 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:07,019 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-10-13 13:09:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 13:09:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-13 13:09:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:07,020 INFO L225 Difference]: With dead ends: 83 [2024-10-13 13:09:07,020 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 13:09:07,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:09:07,021 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:07,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 489 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 13:09:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-13 13:09:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-10-13 13:09:07,023 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 33 [2024-10-13 13:09:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:07,023 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-10-13 13:09:07,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-10-13 13:09:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 13:09:07,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:07,024 INFO L215 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] [2024-10-13 13:09:07,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-13 13:09:07,025 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1963894932, now seen corresponding path program 1 times [2024-10-13 13:09:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196333785] [2024-10-13 13:09:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196333785] [2024-10-13 13:09:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196333785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:07,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-10-13 13:09:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916542925] [2024-10-13 13:09:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 13:09:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 13:09:07,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2024-10-13 13:09:07,509 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 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) [2024-10-13 13:09:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:07,784 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-10-13 13:09:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 13:09:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 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 [2024-10-13 13:09:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:07,785 INFO L225 Difference]: With dead ends: 82 [2024-10-13 13:09:07,785 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 13:09:07,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-10-13 13:09:07,785 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:07,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 443 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 13:09:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 13:09:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 13:09:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.12) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-10-13 13:09:07,789 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 34 [2024-10-13 13:09:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:07,789 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-10-13 13:09:07,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 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) [2024-10-13 13:09:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-10-13 13:09:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 13:09:07,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:07,789 INFO L215 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] [2024-10-13 13:09:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-13 13:09:07,790 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -210280872, now seen corresponding path program 1 times [2024-10-13 13:09:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947814235] [2024-10-13 13:09:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947814235] [2024-10-13 13:09:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947814235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:08,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-13 13:09:08,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377118001] [2024-10-13 13:09:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:08,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 13:09:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 13:09:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-10-13 13:09:08,307 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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) [2024-10-13 13:09:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:08,637 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-10-13 13:09:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 13:09:08,637 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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 [2024-10-13 13:09:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:08,638 INFO L225 Difference]: With dead ends: 92 [2024-10-13 13:09:08,638 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 13:09:08,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-10-13 13:09:08,640 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:08,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 549 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 13:09:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 13:09:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 13:09:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2024-10-13 13:09:08,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 34 [2024-10-13 13:09:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2024-10-13 13:09:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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) [2024-10-13 13:09:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2024-10-13 13:09:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 13:09:08,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:08,645 INFO L215 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] [2024-10-13 13:09:08,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-13 13:09:08,654 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash -210274914, now seen corresponding path program 1 times [2024-10-13 13:09:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403806255] [2024-10-13 13:09:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403806255] [2024-10-13 13:09:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403806255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:09:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648367709] [2024-10-13 13:09:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:08,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:09:08,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:08,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:09:08,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:08,696 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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) [2024-10-13 13:09:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:08,746 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-10-13 13:09:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:09:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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 [2024-10-13 13:09:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:08,747 INFO L225 Difference]: With dead ends: 78 [2024-10-13 13:09:08,747 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 13:09:08,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:09:08,748 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:08,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:09:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 13:09:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 13:09:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.082191780821918) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-10-13 13:09:08,750 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 34 [2024-10-13 13:09:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-10-13 13:09:08,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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) [2024-10-13 13:09:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-10-13 13:09:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 13:09:08,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:08,751 INFO L215 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] [2024-10-13 13:09:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-13 13:09:08,751 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2058086033, now seen corresponding path program 1 times [2024-10-13 13:09:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781369993] [2024-10-13 13:09:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:09:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:09:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:09:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781369993] [2024-10-13 13:09:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781369993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:09:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:09:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 13:09:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799853680] [2024-10-13 13:09:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:09:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 13:09:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:09:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 13:09:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 13:09:08,984 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2024-10-13 13:09:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:09:09,105 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-10-13 13:09:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:09:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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 [2024-10-13 13:09:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:09:09,106 INFO L225 Difference]: With dead ends: 95 [2024-10-13 13:09:09,106 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 13:09:09,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-13 13:09:09,107 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 50 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:09:09,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 237 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:09:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 13:09:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2024-10-13 13:09:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 13:09:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-10-13 13:09:09,111 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 38 [2024-10-13 13:09:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:09:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-10-13 13:09:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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) [2024-10-13 13:09:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-10-13 13:09:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 13:09:09,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:09:09,112 INFO L215 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] [2024-10-13 13:09:09,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-13 13:09:09,112 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-10-13 13:09:09,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:09:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -642540605, now seen corresponding path program 1 times [2024-10-13 13:09:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:09:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765330677] [2024-10-13 13:09:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:09:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:09:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:09:09,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 13:09:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:09:09,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 13:09:09,189 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 13:09:09,190 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2024-10-13 13:09:09,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2024-10-13 13:09:09,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2024-10-13 13:09:09,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2024-10-13 13:09:09,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2024-10-13 13:09:09,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2024-10-13 13:09:09,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 36 remaining) [2024-10-13 13:09:09,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 36 remaining) [2024-10-13 13:09:09,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 36 remaining) [2024-10-13 13:09:09,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2024-10-13 13:09:09,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 36 remaining) [2024-10-13 13:09:09,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 36 remaining) [2024-10-13 13:09:09,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2024-10-13 13:09:09,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2024-10-13 13:09:09,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2024-10-13 13:09:09,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2024-10-13 13:09:09,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 36 remaining) [2024-10-13 13:09:09,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 36 remaining) [2024-10-13 13:09:09,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2024-10-13 13:09:09,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2024-10-13 13:09:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-13 13:09:09,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:09:09,250 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:09:09,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:09:09 BoogieIcfgContainer [2024-10-13 13:09:09,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:09:09,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:09:09,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:09:09,255 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:09:09,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:08:50" (3/4) ... [2024-10-13 13:09:09,256 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 13:09:09,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:09:09,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:09:09,306 INFO L158 Benchmark]: Toolchain (without parser) took 19738.01ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 100.1MB in the beginning and 184.1MB in the end (delta: -84.0MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,306 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:09:09,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.94ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 81.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 78.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,307 INFO L158 Benchmark]: Boogie Preprocessor took 80.42ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 140.0MB in the end (delta: -61.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,307 INFO L158 Benchmark]: RCFGBuilder took 563.73ms. Allocated memory is still 167.8MB. Free memory was 140.0MB in the beginning and 115.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,307 INFO L158 Benchmark]: TraceAbstraction took 18544.83ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 114.3MB in the beginning and 187.2MB in the end (delta: -72.9MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,308 INFO L158 Benchmark]: Witness Printer took 51.72ms. Allocated memory is still 352.3MB. Free memory was 187.2MB in the beginning and 184.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:09:09,308 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.16ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.94ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 81.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 167.8MB. Free memory was 81.2MB in the beginning and 78.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.42ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 140.0MB in the end (delta: -61.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * RCFGBuilder took 563.73ms. Allocated memory is still 167.8MB. Free memory was 140.0MB in the beginning and 115.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18544.83ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 114.3MB in the beginning and 187.2MB in the end (delta: -72.9MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 51.72ms. Allocated memory is still 352.3MB. Free memory was 187.2MB in the beginning and 184.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 601]: integer overflow possible integer overflow possible We found a FailurePath: [L548] int* x = __builtin_alloca (sizeof(int)); [L549] int* y = __builtin_alloca (sizeof(int)); [L550] int* z = __builtin_alloca (sizeof(int)); [L551] int* m = __builtin_alloca (sizeof(int)); [L552] int* n = __builtin_alloca (sizeof(int)); [L553] *y = __VERIFIER_nondet_int() [L554] *z = __VERIFIER_nondet_int() [L555] COND FALSE !(__VERIFIER_nondet_int()) [L558] *x = -1 [L560] EXPR \read(*x) [L560] COND FALSE !(*x > 0) [L563] EXPR \read(*x) [L563] (*x)-- [L563] (*x)-- [L565] EXPR \read(*x) [L565] COND FALSE !(*x > 0) [L568] EXPR \read(*x) [L568] (*x)-- [L568] (*x)-- [L570] EXPR \read(*x) [L570] COND FALSE !(*x > 0) [L573] EXPR \read(*x) [L573] (*x)-- [L573] (*x)-- [L575] EXPR \read(*x) [L575] COND FALSE !(*x > 0) [L578] EXPR \read(*x) [L578] (*x)-- [L578] (*x)-- [L580] EXPR \read(*x) [L580] COND FALSE !(*x > 0) [L583] EXPR \read(*x) [L583] (*x)-- [L583] (*x)-- [L585] EXPR \read(*x) [L585] COND FALSE !(*x > 0) [L588] EXPR \read(*x) [L588] (*x)-- [L588] (*x)-- [L590] EXPR \read(*x) [L590] COND FALSE !(*x > 0) [L593] EXPR \read(*x) [L593] (*x)-- [L593] (*x)-- [L595] EXPR \read(*x) [L595] COND FALSE !(*x > 0) [L598] EXPR \read(*x) [L598] (*x)-- [L598] (*x)-- [L600] EXPR \read(*y) [L600] *y < 100 && *z < 100 VAL [x={2:0}, y={7:0}, z={5:0}] [L600] *y < 100 && *z < 100 [L600] EXPR \read(*z) [L600] *y < 100 && *z < 100 VAL [x={2:0}, y={7:0}, z={5:0}] [L600] COND TRUE *y < 100 && *z < 100 [L601] EXPR \read(*y) [L601] EXPR \read(*x) [L601] *y + *x VAL [x={2:0}, y={7:0}, z={5:0}] - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 602]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 52, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 757 mSDsluCounter, 18285 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14506 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10978 IncrementalHoareTripleChecker+Invalid, 11039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 3779 mSDtfsCounter, 10978 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, InterpolantAutomatonStates: 508, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 102 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 4674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 51 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-13 13:09:09,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)