./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-restricted-15/LogAG.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/LogAG.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 68bdf78f6f996480ccfcf11b22cc3b7892db15596cae3edf06123d71c4506b1f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:19:01,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:19:01,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:19:01,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:19:01,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:19:01,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:19:01,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:19:01,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:19:01,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:19:01,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:19:01,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:19:01,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:19:01,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:19:01,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:19:01,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:19:01,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:19:01,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:19:01,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:19:01,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:19:01,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:19:01,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:19:01,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:19:01,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:19:01,339 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:19:01,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:19:01,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:19:01,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:19:01,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:19:01,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:19:01,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:19:01,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:19:01,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:01,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:19:01,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:19:01,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:19:01,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:19:01,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:19:01,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:19:01,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:19:01,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:19:01,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:19:01,343 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-clean/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-clean/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 -> 68bdf78f6f996480ccfcf11b22cc3b7892db15596cae3edf06123d71c4506b1f [2024-10-11 20:19:01,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:19:01,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:19:01,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:19:01,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:19:01,612 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:19:01,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/LogAG.c [2024-10-11 20:19:03,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:19:03,189 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:19:03,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/LogAG.c [2024-10-11 20:19:03,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f4cbd149/d189fa45751f43edb0b91c3837fc0b11/FLAGd1124eb3a [2024-10-11 20:19:03,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f4cbd149/d189fa45751f43edb0b91c3837fc0b11 [2024-10-11 20:19:03,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:19:03,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:19:03,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:03,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:19:03,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:19:03,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3ed783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03, skipping insertion in model container [2024-10-11 20:19:03,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:19:03,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:03,425 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:19:03,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:19:03,455 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:19:03,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03 WrapperNode [2024-10-11 20:19:03,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:19:03,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:03,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:19:03,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:19:03,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,484 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-10-11 20:19:03,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:19:03,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:19:03,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:19:03,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:19:03,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,505 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:19:03,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:19:03,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:19:03,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:19:03,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:19:03,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (1/1) ... [2024-10-11 20:19:03,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:19:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:03,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:19:03,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:19:03,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:19:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:19:03,665 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:19:03,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:19:03,755 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 20:19:03,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:19:03,778 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:19:03,779 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:19:03,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:03 BoogieIcfgContainer [2024-10-11 20:19:03,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:19:03,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:19:03,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:19:03,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:19:03,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:19:03" (1/3) ... [2024-10-11 20:19:03,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:03, skipping insertion in model container [2024-10-11 20:19:03,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:19:03" (2/3) ... [2024-10-11 20:19:03,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:19:03, skipping insertion in model container [2024-10-11 20:19:03,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:19:03" (3/3) ... [2024-10-11 20:19:03,791 INFO L112 eAbstractionObserver]: Analyzing ICFG LogAG.c [2024-10-11 20:19:03,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:19:03,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 20:19:03,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:19:03,876 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;@24448f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:19:03,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 20:19:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 2.0) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:19:03,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:03,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:19:03,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:03,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash 80116, now seen corresponding path program 1 times [2024-10-11 20:19:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655230663] [2024-10-11 20:19:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:03,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,090 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-11 20:19:04,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655230663] [2024-10-11 20:19:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655230663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:04,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978653316] [2024-10-11 20:19:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,129 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 2.0) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,160 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-11 20:19:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:19:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,168 INFO L225 Difference]: With dead ends: 48 [2024-10-11 20:19:04,168 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 20:19:04,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,173 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 20:19:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 20:19:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-11 20:19:04,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 3 [2024-10-11 20:19:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,199 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-11 20:19:04,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-11 20:19:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:19:04,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:19:04,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:19:04,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2483641, now seen corresponding path program 1 times [2024-10-11 20:19:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581009577] [2024-10-11 20:19:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,239 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-11 20:19:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581009577] [2024-10-11 20:19:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581009577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530617207] [2024-10-11 20:19:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,243 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,261 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-10-11 20:19:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:19:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,263 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:19:04,263 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:19:04,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,265 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:19:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 20:19:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-11 20:19:04,272 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 4 [2024-10-11 20:19:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,272 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-11 20:19:04,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-11 20:19:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:19:04,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:19:04,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1908186616, now seen corresponding path program 1 times [2024-10-11 20:19:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374684380] [2024-10-11 20:19:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,349 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-11 20:19:04,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374684380] [2024-10-11 20:19:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374684380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335650411] [2024-10-11 20:19:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:04,353 INFO L87 Difference]: Start difference. First operand 21 states and 22 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-11 20:19:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,389 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-11 20:19:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:04,390 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-11 20:19:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,390 INFO L225 Difference]: With dead ends: 25 [2024-10-11 20:19:04,390 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 20:19:04,391 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-11 20:19:04,392 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 20:19:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-11 20:19:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-11 20:19:04,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-10-11 20:19:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,402 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-11 20:19:04,402 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-11 20:19:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-11 20:19:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:19:04,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:19:04,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 975757117, now seen corresponding path program 1 times [2024-10-11 20:19:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090966325] [2024-10-11 20:19:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,461 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-11 20:19:04,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090966325] [2024-10-11 20:19:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090966325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301356047] [2024-10-11 20:19:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,467 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,490 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-10-11 20:19:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:19:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,495 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:19:04,495 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:19:04,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,497 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:19:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 20:19:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-11 20:19:04,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2024-10-11 20:19:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-11 20:19:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-11 20:19:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:19:04,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:19:04,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 975758687, now seen corresponding path program 1 times [2024-10-11 20:19:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834413061] [2024-10-11 20:19:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,569 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-11 20:19:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834413061] [2024-10-11 20:19:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834413061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719653843] [2024-10-11 20:19:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:04,574 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,611 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-10-11 20:19:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:19:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,612 INFO L225 Difference]: With dead ends: 21 [2024-10-11 20:19:04,612 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 20:19:04,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-11 20:19:04,614 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 20:19:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 20:19:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 19 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-11 20:19:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-11 20:19:04,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2024-10-11 20:19:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-11 20:19:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-11 20:19:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:19:04,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:19:04,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash 183699626, now seen corresponding path program 1 times [2024-10-11 20:19:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256884007] [2024-10-11 20:19:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,678 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-11 20:19:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256884007] [2024-10-11 20:19:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256884007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631811930] [2024-10-11 20:19:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,681 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,695 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-10-11 20:19:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:19:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,697 INFO L225 Difference]: With dead ends: 20 [2024-10-11 20:19:04,697 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 20:19:04,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,699 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 20:19:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 20:19:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-11 20:19:04,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2024-10-11 20:19:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,711 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-11 20:19:04,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-11 20:19:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:19:04,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:19:04,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 183748285, now seen corresponding path program 1 times [2024-10-11 20:19:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013238745] [2024-10-11 20:19:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,739 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-11 20:19:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013238745] [2024-10-11 20:19:04,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013238745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021199526] [2024-10-11 20:19:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,742 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,763 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-10-11 20:19:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:19:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,765 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:19:04,766 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 20:19:04,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,767 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 20:19:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-11 20:19:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-11 20:19:04,778 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2024-10-11 20:19:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,778 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-11 20:19:04,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-11 20:19:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:19:04,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:19:04,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1399721183, now seen corresponding path program 1 times [2024-10-11 20:19:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738436634] [2024-10-11 20:19:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,818 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-11 20:19:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738436634] [2024-10-11 20:19:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738436634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:19:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645189379] [2024-10-11 20:19:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,820 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11 20:19:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,841 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-11 20:19:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11 20:19:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,844 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:19:04,844 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 20:19:04,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,845 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 20:19:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-10-11 20:19:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 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-11 20:19:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-11 20:19:04,850 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 9 [2024-10-11 20:19:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,850 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-11 20:19:04,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11 20:19:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-11 20:19:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:19:04,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:19:04,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1401229601, now seen corresponding path program 1 times [2024-10-11 20:19:04,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187875657] [2024-10-11 20:19:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,891 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-11 20:19:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187875657] [2024-10-11 20:19:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187875657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:19:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814252724] [2024-10-11 20:19:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:19:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:19:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,893 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:04,914 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-11 20:19:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:19:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:19:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:04,916 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:19:04,916 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:19:04,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:19:04,917 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:04,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:19:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2024-10-11 20:19:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-10-11 20:19:04,930 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 9 [2024-10-11 20:19:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:04,930 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-10-11 20:19:04,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-10-11 20:19:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:19:04,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:04,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:04,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:19:04,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:04,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2038082704, now seen corresponding path program 1 times [2024-10-11 20:19:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:04,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964172856] [2024-10-11 20:19:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964172856] [2024-10-11 20:19:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964172856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:19:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:19:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485134907] [2024-10-11 20:19:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:19:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:19:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:04,981 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:05,016 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-11 20:19:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:19:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:19:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:05,017 INFO L225 Difference]: With dead ends: 42 [2024-10-11 20:19:05,017 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:19:05,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:19:05,018 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:05,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:19:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-10-11 20:19:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 20:19:05,025 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2024-10-11 20:19:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:05,025 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 20:19:05,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 20:19:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:19:05,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:05,026 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:19:05,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:19:05,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:05,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1432405689, now seen corresponding path program 1 times [2024-10-11 20:19:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177790730] [2024-10-11 20:19:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177790730] [2024-10-11 20:19:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177790730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010319619] [2024-10-11 20:19:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:05,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:05,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:05,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:19:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:05,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:19:05,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010319619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:05,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:05,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-11 20:19:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100471229] [2024-10-11 20:19:05,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:05,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:05,214 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-11 20:19:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:05,245 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-10-11 20:19:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 14 [2024-10-11 20:19:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:05,248 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:19:05,249 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 20:19:05,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:05,250 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:05,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 20:19:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2024-10-11 20:19:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 20:19:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2024-10-11 20:19:05,263 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 14 [2024-10-11 20:19:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:05,264 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2024-10-11 20:19:05,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-11 20:19:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2024-10-11 20:19:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:19:05,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:05,265 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-10-11 20:19:05,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:05,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:19:05,466 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 935410796, now seen corresponding path program 1 times [2024-10-11 20:19:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764632882] [2024-10-11 20:19:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764632882] [2024-10-11 20:19:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764632882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216432724] [2024-10-11 20:19:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:05,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:05,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:05,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:05,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:19:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:05,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:19:05,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216432724] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:05,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:05,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-10-11 20:19:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263747024] [2024-10-11 20:19:05,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:05,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:05,644 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 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-11 20:19:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:05,689 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2024-10-11 20:19:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:05,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 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 17 [2024-10-11 20:19:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:05,694 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:19:05,697 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 20:19:05,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:19:05,698 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:05,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 20:19:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-10-11 20:19:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.1925465838509317) internal successors, (192), 162 states have internal predecessors, (192), 0 states have call successors, (0), 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-11 20:19:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2024-10-11 20:19:05,723 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 17 [2024-10-11 20:19:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:05,723 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2024-10-11 20:19:05,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 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-11 20:19:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2024-10-11 20:19:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:19:05,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:05,725 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-11 20:19:05,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:19:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:05,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1468674271, now seen corresponding path program 2 times [2024-10-11 20:19:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254779361] [2024-10-11 20:19:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254779361] [2024-10-11 20:19:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254779361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336252165] [2024-10-11 20:19:06,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:19:06,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:06,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:06,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:06,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:19:06,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:19:06,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:06,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:19:06,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:06,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336252165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:06,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 20:19:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370912410] [2024-10-11 20:19:06,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:19:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:19:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:19:06,235 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 20:19:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:06,313 INFO L93 Difference]: Finished difference Result 644 states and 732 transitions. [2024-10-11 20:19:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:19:06,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 20:19:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:06,316 INFO L225 Difference]: With dead ends: 644 [2024-10-11 20:19:06,316 INFO L226 Difference]: Without dead ends: 643 [2024-10-11 20:19:06,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:19:06,317 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 152 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:06,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-10-11 20:19:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 313. [2024-10-11 20:19:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 311 states have (on average 1.1961414790996785) internal successors, (372), 312 states have internal predecessors, (372), 0 states have call successors, (0), 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-11 20:19:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 372 transitions. [2024-10-11 20:19:06,359 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 372 transitions. Word has length 29 [2024-10-11 20:19:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:06,359 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 372 transitions. [2024-10-11 20:19:06,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 20:19:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 372 transitions. [2024-10-11 20:19:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 20:19:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:06,361 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2024-10-11 20:19:06,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:19:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:06,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1457233171, now seen corresponding path program 2 times [2024-10-11 20:19:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539693605] [2024-10-11 20:19:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539693605] [2024-10-11 20:19:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539693605] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711734244] [2024-10-11 20:19:06,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:19:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:06,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:06,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:19:06,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:19:06,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:06,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:19:06,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:19:06,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:19:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711734244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:19:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:19:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 11 [2024-10-11 20:19:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944307319] [2024-10-11 20:19:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:19:06,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:19:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:19:06,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:19:06,753 INFO L87 Difference]: Start difference. First operand 313 states and 372 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:06,790 INFO L93 Difference]: Finished difference Result 319 states and 377 transitions. [2024-10-11 20:19:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:19:06,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-11 20:19:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:06,793 INFO L225 Difference]: With dead ends: 319 [2024-10-11 20:19:06,793 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 20:19:06,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:19:06,795 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:06,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:19:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 20:19:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 20:19:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-10-11 20:19:06,800 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 41 [2024-10-11 20:19:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:06,801 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-10-11 20:19:06,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-10-11 20:19:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 20:19:06,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:06,803 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1] [2024-10-11 20:19:06,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:19:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:19:07,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1608889311, now seen corresponding path program 3 times [2024-10-11 20:19:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154774731] [2024-10-11 20:19:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154774731] [2024-10-11 20:19:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154774731] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147980448] [2024-10-11 20:19:07,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:19:07,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:07,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:07,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:19:07,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 20:19:07,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:07,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:19:07,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147980448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:07,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:07,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-11 20:19:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731451860] [2024-10-11 20:19:07,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:07,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:19:07,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:07,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:19:07,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:19:07,710 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:07,787 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2024-10-11 20:19:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:19:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 20:19:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:07,789 INFO L225 Difference]: With dead ends: 121 [2024-10-11 20:19:07,789 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 20:19:07,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:19:07,791 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:07,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 20:19:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 20:19:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.0084033613445378) internal successors, (120), 119 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 20:19:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2024-10-11 20:19:07,801 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 59 [2024-10-11 20:19:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2024-10-11 20:19:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:19:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2024-10-11 20:19:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 20:19:07,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:07,804 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1, 1, 1] [2024-10-11 20:19:07,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:08,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:19:08,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:08,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 59311649, now seen corresponding path program 4 times [2024-10-11 20:19:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679941333] [2024-10-11 20:19:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:08,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679941333] [2024-10-11 20:19:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679941333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844955168] [2024-10-11 20:19:08,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 20:19:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:08,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:08,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:19:08,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 20:19:08,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:08,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 20:19:08,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:08,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844955168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:09,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:09,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-10-11 20:19:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337126074] [2024-10-11 20:19:09,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:09,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 20:19:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:09,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 20:19:09,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:19:09,830 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand has 48 states, 47 states have (on average 5.0) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 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-11 20:19:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:09,986 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2024-10-11 20:19:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 20:19:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.0) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 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 119 [2024-10-11 20:19:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:09,988 INFO L225 Difference]: With dead ends: 241 [2024-10-11 20:19:09,988 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 20:19:09,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 20:19:09,989 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:09,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:19:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 20:19:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-11 20:19:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.00418410041841) internal successors, (240), 239 states have internal predecessors, (240), 0 states have call successors, (0), 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-11 20:19:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2024-10-11 20:19:09,999 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 119 [2024-10-11 20:19:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:10,000 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2024-10-11 20:19:10,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.0) internal successors, (235), 48 states have internal predecessors, (235), 0 states have call successors, (0), 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-11 20:19:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2024-10-11 20:19:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 20:19:10,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:10,003 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1, 1, 1] [2024-10-11 20:19:10,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:19:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:19:10,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:10,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:10,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2118288863, now seen corresponding path program 5 times [2024-10-11 20:19:10,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494340411] [2024-10-11 20:19:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494340411] [2024-10-11 20:19:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494340411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391595834] [2024-10-11 20:19:12,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 20:19:12,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:12,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:12,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:19:12,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-11 20:19:12,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:12,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 20:19:12,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:12,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391595834] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:15,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-10-11 20:19:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202346086] [2024-10-11 20:19:15,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:15,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-11 20:19:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:15,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-11 20:19:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:19:15,359 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand has 96 states, 95 states have (on average 5.0) internal successors, (475), 96 states have internal predecessors, (475), 0 states have call successors, (0), 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-11 20:19:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:15,797 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2024-10-11 20:19:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 20:19:15,797 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.0) internal successors, (475), 96 states have internal predecessors, (475), 0 states have call successors, (0), 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 239 [2024-10-11 20:19:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:15,800 INFO L225 Difference]: With dead ends: 481 [2024-10-11 20:19:15,800 INFO L226 Difference]: Without dead ends: 480 [2024-10-11 20:19:15,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 20:19:15,803 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:15,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:19:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-11 20:19:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2024-10-11 20:19:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.0020876826722338) internal successors, (480), 479 states have internal predecessors, (480), 0 states have call successors, (0), 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-11 20:19:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2024-10-11 20:19:15,819 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 239 [2024-10-11 20:19:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:15,820 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2024-10-11 20:19:15,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.0) internal successors, (475), 96 states have internal predecessors, (475), 0 states have call successors, (0), 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-11 20:19:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2024-10-11 20:19:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-11 20:19:15,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:15,828 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 1, 1, 1, 1, 1] [2024-10-11 20:19:15,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:16,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 830628385, now seen corresponding path program 6 times [2024-10-11 20:19:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392584291] [2024-10-11 20:19:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392584291] [2024-10-11 20:19:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392584291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834277961] [2024-10-11 20:19:21,966 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 20:19:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:21,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:21,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:19:22,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-11 20:19:22,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:19:22,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 20:19:22,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:22,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:19:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834277961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:19:32,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:19:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2024-10-11 20:19:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419795313] [2024-10-11 20:19:32,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:19:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2024-10-11 20:19:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:19:32,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2024-10-11 20:19:32,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:19:32,022 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand has 192 states, 191 states have (on average 5.0) internal successors, (955), 192 states have internal predecessors, (955), 0 states have call successors, (0), 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-11 20:19:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:19:33,124 INFO L93 Difference]: Finished difference Result 961 states and 1056 transitions. [2024-10-11 20:19:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2024-10-11 20:19:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.0) internal successors, (955), 192 states have internal predecessors, (955), 0 states have call successors, (0), 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 479 [2024-10-11 20:19:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:19:33,128 INFO L225 Difference]: With dead ends: 961 [2024-10-11 20:19:33,128 INFO L226 Difference]: Without dead ends: 960 [2024-10-11 20:19:33,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 862 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 20:19:33,131 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:19:33,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:19:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-11 20:19:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-10-11 20:19:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.0010427528675705) internal successors, (960), 959 states have internal predecessors, (960), 0 states have call successors, (0), 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-11 20:19:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 960 transitions. [2024-10-11 20:19:33,157 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 960 transitions. Word has length 479 [2024-10-11 20:19:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:19:33,157 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 960 transitions. [2024-10-11 20:19:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.0) internal successors, (955), 192 states have internal predecessors, (955), 0 states have call successors, (0), 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-11 20:19:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 960 transitions. [2024-10-11 20:19:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2024-10-11 20:19:33,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:19:33,183 INFO L215 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 1, 1, 1, 1, 1] [2024-10-11 20:19:33,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:19:33,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:19:33,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:19:33,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:19:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash 243020321, now seen corresponding path program 7 times [2024-10-11 20:19:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:19:33,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640720150] [2024-10-11 20:19:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:19:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:19:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:19:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640720150] [2024-10-11 20:19:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640720150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:19:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307667184] [2024-10-11 20:19:55,621 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 20:19:55,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:19:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:19:55,623 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:19:55,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:19:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:19:55,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 1730 conjuncts, 192 conjuncts are in the unsatisfiable core [2024-10-11 20:19:55,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:19:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:19:56,863 INFO L311 TraceCheckSpWp]: Computing backward predicates...