./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/a.06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/a.06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90244b6c2e1b1f029f80e9cfc86fb57c09347d52a85284d5d619fffbbf31f641 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:16:56,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:16:56,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:16:56,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:16:56,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:16:56,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:16:56,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:16:56,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:16:56,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:16:56,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:16:56,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:16:56,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:16:56,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:16:56,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:16:56,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:16:56,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:16:56,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:16:56,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:16:56,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:16:56,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:16:56,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:16:56,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:16:56,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:16:56,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:16:56,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:16:56,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:16:56,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:16:56,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:16:56,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:16:56,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:16:56,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:16:56,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:16:56,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:16:56,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:16:56,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:16:56,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:16:56,879 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90244b6c2e1b1f029f80e9cfc86fb57c09347d52a85284d5d619fffbbf31f641 [2024-10-14 20:16:57,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:16:57,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:16:57,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:16:57,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:16:57,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:16:57,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/a.06.c [2024-10-14 20:16:58,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:16:58,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:16:58,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/a.06.c [2024-10-14 20:16:58,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902caf4c4/3c5e304078c14a2ca071fe44b07bff39/FLAG1db21847c [2024-10-14 20:16:58,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902caf4c4/3c5e304078c14a2ca071fe44b07bff39 [2024-10-14 20:16:58,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:16:58,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:16:58,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:16:58,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:16:58,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:16:58,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299b1e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58, skipping insertion in model container [2024-10-14 20:16:58,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:16:58,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:16:58,780 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:16:58,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:16:58,808 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:16:58,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58 WrapperNode [2024-10-14 20:16:58,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:16:58,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:16:58,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:16:58,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:16:58,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,869 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-10-14 20:16:58,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:16:58,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:16:58,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:16:58,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:16:58,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,885 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-14 20:16:58,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:16:58,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:16:58,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:16:58,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:16:58,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (1/1) ... [2024-10-14 20:16:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:16:58,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:16:58,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:16:58,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:16:58,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:16:58,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:16:59,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:16:59,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:16:59,119 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 20:16:59,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:16:59,140 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:16:59,140 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:16:59,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:59 BoogieIcfgContainer [2024-10-14 20:16:59,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:16:59,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:16:59,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:16:59,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:16:59,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:16:58" (1/3) ... [2024-10-14 20:16:59,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b67e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:59, skipping insertion in model container [2024-10-14 20:16:59,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:16:58" (2/3) ... [2024-10-14 20:16:59,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b67e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:16:59, skipping insertion in model container [2024-10-14 20:16:59,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:59" (3/3) ... [2024-10-14 20:16:59,147 INFO L112 eAbstractionObserver]: Analyzing ICFG a.06.c [2024-10-14 20:16:59,160 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:16:59,160 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-14 20:16:59,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:16:59,213 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;@483d0cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:16:59,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-14 20:16:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 20:16:59,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 20:16:59,222 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-14 20:16:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2956357, now seen corresponding path program 1 times [2024-10-14 20:16:59,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827724255] [2024-10-14 20:16:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,367 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-14 20:16:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827724255] [2024-10-14 20:16:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827724255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426196713] [2024-10-14 20:16:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:59,391 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-14 20:16:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,431 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-10-14 20:16:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:59,433 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-14 20:16:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,439 INFO L225 Difference]: With dead ends: 34 [2024-10-14 20:16:59,439 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:16:59,442 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-14 20:16:59,444 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 14 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:16:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 20:16:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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-14 20:16:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 20:16:59,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 4 [2024-10-14 20:16:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,471 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 20:16:59,472 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-14 20:16:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 20:16:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:16:59,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:16:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:16:59,473 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-14 20:16:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 91647111, now seen corresponding path program 1 times [2024-10-14 20:16:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034278932] [2024-10-14 20:16:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,525 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-14 20:16:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034278932] [2024-10-14 20:16:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034278932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:16:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994285296] [2024-10-14 20:16:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:16:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:16:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:16:59,530 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,594 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-14 20:16:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:16:59,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:16:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,596 INFO L225 Difference]: With dead ends: 49 [2024-10-14 20:16:59,596 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 20:16:59,596 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-14 20:16:59,598 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:16:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 20:16:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-10-14 20:16:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 43 states have internal predecessors, (57), 0 states have call successors, (0), 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-14 20:16:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-10-14 20:16:59,611 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 5 [2024-10-14 20:16:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,611 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-10-14 20:16:59,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-10-14 20:16:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:16:59,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:59,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:16:59,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:16:59,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1162526250, now seen corresponding path program 1 times [2024-10-14 20:16:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135015750] [2024-10-14 20:16:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,705 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-14 20:16:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135015750] [2024-10-14 20:16:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135015750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:16:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403210882] [2024-10-14 20:16:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:16:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:16:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:16:59,711 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,735 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2024-10-14 20:16:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:16:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:16:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,736 INFO L225 Difference]: With dead ends: 89 [2024-10-14 20:16:59,736 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 20:16:59,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-14 20:16:59,737 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 20:16:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-14 20:16:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-10-14 20:16:59,742 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 8 [2024-10-14 20:16:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-10-14 20:16:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-10-14 20:16:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:16:59,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:16:59,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:16:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1162476630, now seen corresponding path program 1 times [2024-10-14 20:16:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674347745] [2024-10-14 20:16:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,768 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-14 20:16:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674347745] [2024-10-14 20:16:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674347745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:16:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984615260] [2024-10-14 20:16:59,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:16:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:16:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:16:59,770 INFO L87 Difference]: Start difference. First operand 46 states and 58 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-14 20:16:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,790 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-14 20:16:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:16:59,790 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-14 20:16:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,790 INFO L225 Difference]: With dead ends: 46 [2024-10-14 20:16:59,790 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 20:16:59,791 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-14 20:16:59,791 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 20:16:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2024-10-14 20:16:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 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-14 20:16:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-14 20:16:59,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2024-10-14 20:16:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,795 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-14 20:16:59,795 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-14 20:16:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-14 20:16:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:16:59,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:59,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:16:59,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:16:59,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -442816622, now seen corresponding path program 1 times [2024-10-14 20:16:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366250022] [2024-10-14 20:16:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,844 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-14 20:16:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366250022] [2024-10-14 20:16:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366250022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:16:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769920247] [2024-10-14 20:16:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:16:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:16:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:16:59,846 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,898 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-10-14 20:16:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:16:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:16:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,899 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:16:59,899 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 20:16:59,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:16:59,900 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 20:16:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 20:16:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 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-14 20:16:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-14 20:16:59,903 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 10 [2024-10-14 20:16:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,903 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-14 20:16:59,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-14 20:16:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:16:59,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:59,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:16:59,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:16:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 684189530, now seen corresponding path program 1 times [2024-10-14 20:16:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616186125] [2024-10-14 20:16:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:16:59,935 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-14 20:16:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:16:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616186125] [2024-10-14 20:16:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616186125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:16:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:16:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:16:59,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516678173] [2024-10-14 20:16:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:16:59,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:16:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:16:59,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:16:59,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:16:59,936 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:16:59,978 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-10-14 20:16:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:16:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:16:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:16:59,979 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:16:59,979 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:16:59,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:16:59,980 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:16:59,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:16:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:16:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-10-14 20:16:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-14 20:16:59,984 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 10 [2024-10-14 20:16:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:16:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-14 20:16:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:16:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-10-14 20:16:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:16:59,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:16:59,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:16:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:16:59,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:16:59,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:16:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -264960977, now seen corresponding path program 1 times [2024-10-14 20:16:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:16:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485691473] [2024-10-14 20:16:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:16:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:16:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,041 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-14 20:17:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485691473] [2024-10-14 20:17:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485691473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:17:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099725118] [2024-10-14 20:17:00,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:17:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:17:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,043 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,077 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2024-10-14 20:17:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:17:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 20:17:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,078 INFO L225 Difference]: With dead ends: 61 [2024-10-14 20:17:00,078 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 20:17:00,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,079 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 20:17:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-10-14 20:17:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-10-14 20:17:00,083 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 11 [2024-10-14 20:17:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,084 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-10-14 20:17:00,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-10-14 20:17:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:17:00,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:17:00,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:17:00,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1552533810, now seen corresponding path program 1 times [2024-10-14 20:17:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921442835] [2024-10-14 20:17:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,170 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-14 20:17:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921442835] [2024-10-14 20:17:00,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921442835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:17:00,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024936494] [2024-10-14 20:17:00,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:17:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:17:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:17:00,172 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,240 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2024-10-14 20:17:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:17:00,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 20:17:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,243 INFO L225 Difference]: With dead ends: 99 [2024-10-14 20:17:00,243 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 20:17:00,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:17:00,244 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 71 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 46 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:17:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 20:17:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 40. [2024-10-14 20:17:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-10-14 20:17:00,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2024-10-14 20:17:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,253 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-14 20:17:00,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-10-14 20:17:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:17:00,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:17:00,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:17:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 376333056, now seen corresponding path program 1 times [2024-10-14 20:17:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108877011] [2024-10-14 20:17:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,273 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-14 20:17:00,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108877011] [2024-10-14 20:17:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108877011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:17:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916029414] [2024-10-14 20:17:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:17:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:17:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:17:00,275 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,281 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-10-14 20:17:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:17:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 20:17:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,282 INFO L225 Difference]: With dead ends: 81 [2024-10-14 20:17:00,282 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 20:17:00,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:17:00,284 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-14 20:17:00,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 20:17:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 20:17:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 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-14 20:17:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-10-14 20:17:00,287 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2024-10-14 20:17:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-10-14 20:17:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-10-14 20:17:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:17:00,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:17:00,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:17:00,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -883907781, now seen corresponding path program 1 times [2024-10-14 20:17:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335294585] [2024-10-14 20:17:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,335 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-14 20:17:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335294585] [2024-10-14 20:17:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335294585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:17:00,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780212728] [2024-10-14 20:17:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:17:00,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:17:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,338 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,379 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-10-14 20:17:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:17:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 20:17:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,380 INFO L225 Difference]: With dead ends: 41 [2024-10-14 20:17:00,380 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 20:17:00,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:17:00,381 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 20 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 20:17:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 20:17:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-14 20:17:00,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2024-10-14 20:17:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-14 20:17:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-14 20:17:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:17:00,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:17:00,386 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-14 20:17:00,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 431294195, now seen corresponding path program 1 times [2024-10-14 20:17:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122733611] [2024-10-14 20:17:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,414 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-14 20:17:00,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122733611] [2024-10-14 20:17:00,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122733611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:17:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260350923] [2024-10-14 20:17:00,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:17:00,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:17:00,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,416 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,432 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-10-14 20:17:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:17:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 20:17:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,433 INFO L225 Difference]: With dead ends: 82 [2024-10-14 20:17:00,433 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 20:17:00,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,434 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 20:17:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 20:17:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 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-14 20:17:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-10-14 20:17:00,437 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 13 [2024-10-14 20:17:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,437 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-10-14 20:17:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-10-14 20:17:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:17:00,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:17:00,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-14 20:17:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 697504740, now seen corresponding path program 1 times [2024-10-14 20:17:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847607974] [2024-10-14 20:17:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,452 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-14 20:17:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847607974] [2024-10-14 20:17:00,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847607974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:17:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074501863] [2024-10-14 20:17:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:17:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:17:00,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:17:00,454 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,471 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-10-14 20:17:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:17:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 20:17:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,472 INFO L225 Difference]: With dead ends: 40 [2024-10-14 20:17:00,472 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 20:17:00,472 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-14 20:17:00,472 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 20:17:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-10-14 20:17:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 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-14 20:17:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-14 20:17:00,475 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 14 [2024-10-14 20:17:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,475 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-14 20:17:00,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-14 20:17:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:17:00,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:17:00,477 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-14 20:17:00,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -916664265, now seen corresponding path program 1 times [2024-10-14 20:17:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140862721] [2024-10-14 20:17:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,507 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-14 20:17:00,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140862721] [2024-10-14 20:17:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140862721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:17:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196411596] [2024-10-14 20:17:00,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:17:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:17:00,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:17:00,510 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,545 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-14 20:17:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:17:00,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:17:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,547 INFO L225 Difference]: With dead ends: 72 [2024-10-14 20:17:00,547 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 20:17:00,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:17:00,548 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 20:17:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-14 20:17:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-10-14 20:17:00,555 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2024-10-14 20:17:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,556 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-10-14 20:17:00,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-10-14 20:17:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:17:00,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:17:00,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 20:17:00,557 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-14 20:17:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:17:00,558 INFO L85 PathProgramCache]: Analyzing trace with hash 287159750, now seen corresponding path program 1 times [2024-10-14 20:17:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:17:00,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237863942] [2024-10-14 20:17:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:17:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:17:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:17:00,573 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-14 20:17:00,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:17:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237863942] [2024-10-14 20:17:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237863942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:17:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:17:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:17:00,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590603425] [2024-10-14 20:17:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:17:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:17:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:17:00,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:17:00,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:17:00,575 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:17:00,584 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-14 20:17:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:17:00,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:17:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:17:00,585 INFO L225 Difference]: With dead ends: 34 [2024-10-14 20:17:00,585 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:17:00,585 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-14 20:17:00,585 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:17:00,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:17:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:17:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:17:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:17:00,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-10-14 20:17:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:17:00,587 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:17:00,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:17:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:17:00,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:17:00,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-14 20:17:00,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-14 20:17:00,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-14 20:17:00,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-14 20:17:00,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 20:17:00,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:17:00,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:17:00,649 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:17:00,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:17:00 BoogieIcfgContainer [2024-10-14 20:17:00,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:17:00,660 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:17:00,660 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:17:00,660 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:17:00,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:16:59" (3/4) ... [2024-10-14 20:17:00,662 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:17:00,667 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:17:00,668 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:17:00,668 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:17:00,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:17:00,730 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:17:00,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:17:00,731 INFO L158 Benchmark]: Toolchain (without parser) took 2101.94ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 94.1MB in the beginning and 126.5MB in the end (delta: -32.3MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,731 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 119.4MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:17:00,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.40ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 83.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.90ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 136.6MB in the end (delta: -53.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,731 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,732 INFO L158 Benchmark]: RCFGBuilder took 243.66ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 135.1MB in the beginning and 236.2MB in the end (delta: -101.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,732 INFO L158 Benchmark]: TraceAbstraction took 1517.58ms. Allocated memory is still 276.8MB. Free memory was 236.2MB in the beginning and 130.7MB in the end (delta: 105.6MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,732 INFO L158 Benchmark]: Witness Printer took 70.23ms. Allocated memory is still 276.8MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:17:00,733 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 119.4MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.40ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 83.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.90ms. Allocated memory is still 167.8MB. Free memory was 83.4MB in the beginning and 136.6MB in the end (delta: -53.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 135.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 243.66ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 135.1MB in the beginning and 236.2MB in the end (delta: -101.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1517.58ms. Allocated memory is still 276.8MB. Free memory was 236.2MB in the beginning and 130.7MB in the end (delta: 105.6MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Witness Printer took 70.23ms. Allocated memory is still 276.8MB. Free memory was 130.7MB in the beginning and 126.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 586 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 309 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 92 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((z <= 2147483647) && (0 <= (z + 2147483648))) && (0 <= (y + 2147483648))) && (y <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:17:00,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE