./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-crafted/NestedRecursion_1a-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:13:01,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:13:01,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:13:01,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:13:01,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:13:01,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:13:01,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:13:01,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:13:01,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:13:01,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:13:01,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:13:01,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:13:01,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:13:01,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:13:01,865 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:13:01,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:13:01,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:13:01,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:13:01,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:13:01,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:13:01,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:13:01,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:13:01,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:13:01,868 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:13:01,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:13:01,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:13:01,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:13:01,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:13:01,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:13:01,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:13:01,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:13:01,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:13:01,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:13:01,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:13:01,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:13:01,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d925f1aaa578011e84cee59af464c9f4e53ab5dc54b7f9269f34505d8383253a [2024-10-11 20:13:02,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:13:02,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:13:02,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:13:02,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:13:02,098 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:13:02,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-10-11 20:13:03,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:13:03,437 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:13:03,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1a-2.c [2024-10-11 20:13:03,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/664020585/f1ede041817348df9ba2001704372020/FLAGca5bd8dc3 [2024-10-11 20:13:03,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/664020585/f1ede041817348df9ba2001704372020 [2024-10-11 20:13:03,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:13:03,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:13:03,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:13:03,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:13:03,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:13:03,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:13:03" (1/1) ... [2024-10-11 20:13:03,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556422e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:03, skipping insertion in model container [2024-10-11 20:13:03,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:13:03" (1/1) ... [2024-10-11 20:13:03,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:13:04,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:13:04,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:13:04,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:13:04,033 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:13:04,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04 WrapperNode [2024-10-11 20:13:04,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:13:04,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:13:04,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:13:04,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:13:04,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,058 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2024-10-11 20:13:04,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:13:04,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:13:04,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:13:04,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:13:04,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,077 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 20:13:04,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:13:04,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:13:04,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:13:04,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:13:04,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (1/1) ... [2024-10-11 20:13:04,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:13:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:04,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:13:04,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:13:04,161 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2024-10-11 20:13:04,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2024-10-11 20:13:04,161 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2024-10-11 20:13:04,161 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2024-10-11 20:13:04,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:13:04,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:13:04,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:13:04,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:13:04,310 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 20:13:04,310 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:13:04,331 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:13:04,331 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 20:13:04,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:13:04 BoogieIcfgContainer [2024-10-11 20:13:04,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:13:04,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:13:04,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:13:04,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:13:04,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:13:03" (1/3) ... [2024-10-11 20:13:04,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26943bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:13:04, skipping insertion in model container [2024-10-11 20:13:04,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:13:04" (2/3) ... [2024-10-11 20:13:04,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26943bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:13:04, skipping insertion in model container [2024-10-11 20:13:04,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:13:04" (3/3) ... [2024-10-11 20:13:04,340 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1a-2.c [2024-10-11 20:13:04,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:13:04,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 20:13:04,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:13:04,406 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;@1a7c3976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:13:04,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 20:13:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:13:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:13:04,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:04,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:13:04,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:04,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1442097593, now seen corresponding path program 1 times [2024-10-11 20:13:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168372526] [2024-10-11 20:13:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168372526] [2024-10-11 20:13:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168372526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:13:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781806584] [2024-10-11 20:13:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:13:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:13:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:04,566 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:04,594 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-10-11 20:13:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:13:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:13:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:04,602 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:13:04,602 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 20:13:04,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:04,606 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:04,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 20:13:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-11 20:13:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:13:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-11 20:13:04,633 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 6 [2024-10-11 20:13:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:04,633 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-11 20:13:04,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-10-11 20:13:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:13:04,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:04,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:04,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:13:04,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1755352361, now seen corresponding path program 1 times [2024-10-11 20:13:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394777053] [2024-10-11 20:13:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394777053] [2024-10-11 20:13:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394777053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:13:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514679043] [2024-10-11 20:13:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:04,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:13:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:04,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:13:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:13:04,684 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:04,734 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-11 20:13:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:13:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:13:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:04,736 INFO L225 Difference]: With dead ends: 59 [2024-10-11 20:13:04,736 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 20:13:04,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:13:04,737 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:04,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 152 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 20:13:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-10-11 20:13:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:13:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-10-11 20:13:04,750 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2024-10-11 20:13:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:04,750 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-11 20:13:04,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-10-11 20:13:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:13:04,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:04,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:04,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:13:04,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:04,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash 576061948, now seen corresponding path program 1 times [2024-10-11 20:13:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392507199] [2024-10-11 20:13:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:04,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392507199] [2024-10-11 20:13:04,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392507199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:04,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:04,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:13:04,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582359902] [2024-10-11 20:13:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:04,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:13:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:13:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:04,788 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:04,802 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-10-11 20:13:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:13:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:13:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:04,803 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:13:04,803 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 20:13:04,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:04,804 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 20:13:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-10-11 20:13:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:13:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-11 20:13:04,814 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 11 [2024-10-11 20:13:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-11 20:13:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-10-11 20:13:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:13:04,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:04,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:04,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:13:04,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash 678051242, now seen corresponding path program 1 times [2024-10-11 20:13:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:04,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318645938] [2024-10-11 20:13:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:04,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318645938] [2024-10-11 20:13:04,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318645938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:04,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:13:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275475366] [2024-10-11 20:13:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:04,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:13:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:04,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:13:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:13:04,930 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,077 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-10-11 20:13:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:13:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 20:13:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,079 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:13:05,079 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:13:05,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:13:05,082 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 51 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 182 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:13:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:13:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-10-11 20:13:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.372093023255814) internal successors, (59), 50 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:13:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-10-11 20:13:05,091 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 12 [2024-10-11 20:13:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,091 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-10-11 20:13:05,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:13:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-10-11 20:13:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:13:05,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,092 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:13:05,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1701183343, now seen corresponding path program 1 times [2024-10-11 20:13:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227182957] [2024-10-11 20:13:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:13:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227182957] [2024-10-11 20:13:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227182957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:13:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4000724] [2024-10-11 20:13:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:13:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:13:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:13:05,202 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,264 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2024-10-11 20:13:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:13:05,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 20:13:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,266 INFO L225 Difference]: With dead ends: 128 [2024-10-11 20:13:05,267 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:13:05,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 20:13:05,269 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 98 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:13:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:13:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-11 20:13:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 52 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-10-11 20:13:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-10-11 20:13:05,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 18 [2024-10-11 20:13:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,277 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-10-11 20:13:05,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-10-11 20:13:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:13:05,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,278 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:13:05,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash -719559311, now seen corresponding path program 1 times [2024-10-11 20:13:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583686074] [2024-10-11 20:13:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:13:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583686074] [2024-10-11 20:13:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583686074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:13:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515399071] [2024-10-11 20:13:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:13:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:13:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:05,322 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,351 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-11 20:13:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:13:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-10-11 20:13:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,356 INFO L225 Difference]: With dead ends: 90 [2024-10-11 20:13:05,357 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 20:13:05,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:05,358 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 20:13:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2024-10-11 20:13:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-11 20:13:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-10-11 20:13:05,376 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2024-10-11 20:13:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,377 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-10-11 20:13:05,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-10-11 20:13:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:13:05,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,377 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:13:05,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash -831502117, now seen corresponding path program 1 times [2024-10-11 20:13:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952837394] [2024-10-11 20:13:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:13:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952837394] [2024-10-11 20:13:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952837394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:13:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641500839] [2024-10-11 20:13:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:13:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:13:05,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:05,403 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,413 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-10-11 20:13:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:13:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 20:13:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,416 INFO L225 Difference]: With dead ends: 73 [2024-10-11 20:13:05,417 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 20:13:05,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:05,417 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 20:13:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 20:13:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 55 states have internal predecessors, (63), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-11 20:13:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2024-10-11 20:13:05,432 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 20 [2024-10-11 20:13:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,433 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-10-11 20:13:05,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2024-10-11 20:13:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:13:05,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,433 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:13:05,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 252324898, now seen corresponding path program 1 times [2024-10-11 20:13:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492296333] [2024-10-11 20:13:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:13:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492296333] [2024-10-11 20:13:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492296333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:13:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74121394] [2024-10-11 20:13:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:13:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:13:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:13:05,504 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,564 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2024-10-11 20:13:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:13:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 20:13:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,567 INFO L225 Difference]: With dead ends: 156 [2024-10-11 20:13:05,567 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:13:05,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:13:05,569 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:13:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-10-11 20:13:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 62 states have internal predecessors, (68), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-11 20:13:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2024-10-11 20:13:05,577 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 25 [2024-10-11 20:13:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,577 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2024-10-11 20:13:05,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:13:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2024-10-11 20:13:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:13:05,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,578 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:13:05,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1301845805, now seen corresponding path program 1 times [2024-10-11 20:13:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146073415] [2024-10-11 20:13:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 20:13:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:13:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146073415] [2024-10-11 20:13:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146073415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:13:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858955606] [2024-10-11 20:13:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:13:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:13:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:13:05,642 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:13:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,683 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-10-11 20:13:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:13:05,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 20:13:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,684 INFO L225 Difference]: With dead ends: 168 [2024-10-11 20:13:05,684 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 20:13:05,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:13:05,685 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 20:13:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2024-10-11 20:13:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 67 states have internal predecessors, (73), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:13:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-10-11 20:13:05,716 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 31 [2024-10-11 20:13:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-11 20:13:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:13:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-10-11 20:13:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 20:13:05,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,720 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:13:05,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701033, now seen corresponding path program 1 times [2024-10-11 20:13:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262474541] [2024-10-11 20:13:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 20:13:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:13:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 20:13:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262474541] [2024-10-11 20:13:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262474541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:13:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555032037] [2024-10-11 20:13:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:13:05,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:13:05,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:05,759 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:13:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,771 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2024-10-11 20:13:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:13:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-11 20:13:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,773 INFO L225 Difference]: With dead ends: 88 [2024-10-11 20:13:05,773 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 20:13:05,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:05,774 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 20:13:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 20:13:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 66 states have internal predecessors, (71), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:13:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2024-10-11 20:13:05,790 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 33 [2024-10-11 20:13:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2024-10-11 20:13:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:13:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2024-10-11 20:13:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:13:05,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,792 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:13:05,792 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1008483268, now seen corresponding path program 1 times [2024-10-11 20:13:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305279410] [2024-10-11 20:13:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:13:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 20:13:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 20:13:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 20:13:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305279410] [2024-10-11 20:13:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305279410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:13:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331422323] [2024-10-11 20:13:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:13:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:13:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:05,853 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:13:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:05,871 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-10-11 20:13:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:13:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-11 20:13:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:05,873 INFO L225 Difference]: With dead ends: 94 [2024-10-11 20:13:05,873 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:13:05,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:05,874 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:05,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:13:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 20:13:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 70 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:13:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-10-11 20:13:05,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 39 [2024-10-11 20:13:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:05,886 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-10-11 20:13:05,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:13:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-10-11 20:13:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:13:05,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:05,888 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:05,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:13:05,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 409606471, now seen corresponding path program 1 times [2024-10-11 20:13:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154896741] [2024-10-11 20:13:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 20:13:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154896741] [2024-10-11 20:13:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154896741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:13:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668156933] [2024-10-11 20:13:05,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:05,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:13:05,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:05,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:13:05,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:13:05,983 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:13:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:06,028 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2024-10-11 20:13:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:13:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-10-11 20:13:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:06,030 INFO L225 Difference]: With dead ends: 103 [2024-10-11 20:13:06,030 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 20:13:06,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:13:06,031 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:06,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 20:13:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2024-10-11 20:13:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 69 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-11 20:13:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2024-10-11 20:13:06,044 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 43 [2024-10-11 20:13:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:06,045 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2024-10-11 20:13:06,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:13:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2024-10-11 20:13:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:13:06,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:06,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:06,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:13:06,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:06,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1420295783, now seen corresponding path program 1 times [2024-10-11 20:13:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57288160] [2024-10-11 20:13:06,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 20:13:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57288160] [2024-10-11 20:13:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57288160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891705326] [2024-10-11 20:13:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:06,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:13:06,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:13:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:13:06,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:13:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 20:13:06,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:13:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 20:13:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891705326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:13:06,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:13:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 20:13:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003331991] [2024-10-11 20:13:06,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:13:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:13:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:13:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:13:06,404 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 20:13:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:06,596 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2024-10-11 20:13:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 20:13:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-11 20:13:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:06,598 INFO L225 Difference]: With dead ends: 194 [2024-10-11 20:13:06,598 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 20:13:06,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:13:06,598 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 101 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:06,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 401 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:13:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 20:13:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2024-10-11 20:13:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 87 states have internal predecessors, (95), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (34), 22 states have call predecessors, (34), 19 states have call successors, (34) [2024-10-11 20:13:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2024-10-11 20:13:06,608 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 42 [2024-10-11 20:13:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:06,608 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2024-10-11 20:13:06,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 20:13:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2024-10-11 20:13:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 20:13:06,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:06,609 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:06,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:13:06,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:13:06,810 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:06,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 653818833, now seen corresponding path program 1 times [2024-10-11 20:13:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:06,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168837011] [2024-10-11 20:13:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:13:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-11 20:13:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168837011] [2024-10-11 20:13:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168837011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:06,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981979735] [2024-10-11 20:13:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:06,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:06,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:13:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:13:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:06,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:13:06,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:13:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 20:13:06,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:13:06,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981979735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:06,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:13:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-11 20:13:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355962486] [2024-10-11 20:13:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:06,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:13:06,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:13:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:13:06,978 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:13:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:07,068 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-10-11 20:13:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:13:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-10-11 20:13:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:07,070 INFO L225 Difference]: With dead ends: 151 [2024-10-11 20:13:07,071 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 20:13:07,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:13:07,071 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:07,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 178 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 20:13:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2024-10-11 20:13:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 107 states have internal predecessors, (117), 25 states have call successors, (25), 8 states have call predecessors, (25), 12 states have return successors, (41), 28 states have call predecessors, (41), 24 states have call successors, (41) [2024-10-11 20:13:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2024-10-11 20:13:07,084 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 54 [2024-10-11 20:13:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:07,085 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2024-10-11 20:13:07,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:13:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2024-10-11 20:13:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:13:07,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:07,087 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:07,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:13:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:07,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -895915619, now seen corresponding path program 1 times [2024-10-11 20:13:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:07,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081816186] [2024-10-11 20:13:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:13:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 20:13:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:07,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081816186] [2024-10-11 20:13:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081816186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:07,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:13:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882718596] [2024-10-11 20:13:07,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:07,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:13:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:07,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:13:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:07,322 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:13:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:07,338 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2024-10-11 20:13:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:13:07,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2024-10-11 20:13:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:07,339 INFO L225 Difference]: With dead ends: 158 [2024-10-11 20:13:07,339 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 20:13:07,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:13:07,340 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:07,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 20:13:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-10-11 20:13:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 114 states have internal predecessors, (125), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (47), 31 states have call predecessors, (47), 24 states have call successors, (47) [2024-10-11 20:13:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 197 transitions. [2024-10-11 20:13:07,348 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 197 transitions. Word has length 44 [2024-10-11 20:13:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:07,348 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 197 transitions. [2024-10-11 20:13:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:13:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 197 transitions. [2024-10-11 20:13:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:13:07,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:07,349 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:13:07,349 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2003580343, now seen corresponding path program 1 times [2024-10-11 20:13:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286201755] [2024-10-11 20:13:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:13:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 20:13:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286201755] [2024-10-11 20:13:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286201755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:07,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:07,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:13:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032471840] [2024-10-11 20:13:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:07,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:13:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:13:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:07,375 INFO L87 Difference]: Start difference. First operand 154 states and 197 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:13:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:07,385 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-10-11 20:13:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:13:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2024-10-11 20:13:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:07,386 INFO L225 Difference]: With dead ends: 154 [2024-10-11 20:13:07,386 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 20:13:07,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:13:07,387 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:07,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 20:13:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 20:13:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.1121495327102804) internal successors, (119), 111 states have internal predecessors, (119), 25 states have call successors, (25), 8 states have call predecessors, (25), 14 states have return successors, (45), 30 states have call predecessors, (45), 24 states have call successors, (45) [2024-10-11 20:13:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 189 transitions. [2024-10-11 20:13:07,395 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 189 transitions. Word has length 45 [2024-10-11 20:13:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:07,395 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 189 transitions. [2024-10-11 20:13:07,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:13:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 189 transitions. [2024-10-11 20:13:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 20:13:07,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:07,396 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:07,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:13:07,397 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:07,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1656852952, now seen corresponding path program 1 times [2024-10-11 20:13:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301136748] [2024-10-11 20:13:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:13:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 20:13:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:13:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 20:13:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 80 proven. 53 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-11 20:13:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301136748] [2024-10-11 20:13:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301136748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689466138] [2024-10-11 20:13:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:07,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:13:07,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:13:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:07,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:13:07,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:13:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 77 proven. 56 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-11 20:13:07,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:13:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 77 proven. 57 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-10-11 20:13:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689466138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:13:08,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:13:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 17 [2024-10-11 20:13:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928372639] [2024-10-11 20:13:08,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:13:08,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:13:08,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:08,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:13:08,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:13:08,117 INFO L87 Difference]: Start difference. First operand 150 states and 189 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 12 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-11 20:13:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:08,342 INFO L93 Difference]: Finished difference Result 236 states and 326 transitions. [2024-10-11 20:13:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:13:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 12 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 108 [2024-10-11 20:13:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:08,344 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:13:08,344 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 20:13:08,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 232 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:13:08,345 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:08,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:13:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 20:13:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 177. [2024-10-11 20:13:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 126 states have (on average 1.1031746031746033) internal successors, (139), 129 states have internal predecessors, (139), 30 states have call successors, (30), 8 states have call predecessors, (30), 17 states have return successors, (64), 39 states have call predecessors, (64), 29 states have call successors, (64) [2024-10-11 20:13:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2024-10-11 20:13:08,358 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 108 [2024-10-11 20:13:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:08,358 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2024-10-11 20:13:08,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 12 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-10-11 20:13:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2024-10-11 20:13:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:13:08,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:08,359 INFO L215 NwaCegarLoop]: trace histogram [11, 8, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:08,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:13:08,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:08,564 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2078772712, now seen corresponding path program 2 times [2024-10-11 20:13:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:08,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757922003] [2024-10-11 20:13:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:13:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:13:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-11 20:13:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757922003] [2024-10-11 20:13:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757922003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:13:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585124099] [2024-10-11 20:13:08,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:13:08,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:13:08,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:13:08,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:13:08,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:13:08,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:13:08,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:13:08,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:13:08,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:13:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-11 20:13:08,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:13:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-11 20:13:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585124099] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:13:08,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:13:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2024-10-11 20:13:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681022702] [2024-10-11 20:13:08,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:13:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:13:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:13:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:13:08,900 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:13:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:08,968 INFO L93 Difference]: Finished difference Result 266 states and 347 transitions. [2024-10-11 20:13:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:13:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2024-10-11 20:13:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:08,969 INFO L225 Difference]: With dead ends: 266 [2024-10-11 20:13:08,969 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 20:13:08,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:13:08,971 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:08,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 158 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 20:13:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-10-11 20:13:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-11 20:13:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-11 20:13:08,975 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 84 [2024-10-11 20:13:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-11 20:13:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:13:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-11 20:13:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:13:08,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:13:08,977 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:08,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:13:09,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:13:09,178 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 20:13:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:13:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1224623314, now seen corresponding path program 2 times [2024-10-11 20:13:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:13:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890008292] [2024-10-11 20:13:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:13:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:13:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:13:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:13:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:13:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:13:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 20:13:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:13:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:13:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 20:13:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:13:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890008292] [2024-10-11 20:13:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890008292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:13:09,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:13:09,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:13:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462497730] [2024-10-11 20:13:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:13:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:13:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:13:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:13:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:13:09,265 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:13:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:13:09,299 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-11 20:13:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:13:09,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-11 20:13:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:13:09,300 INFO L225 Difference]: With dead ends: 70 [2024-10-11 20:13:09,300 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:13:09,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:13:09,301 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:13:09,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 155 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:13:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:13:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:13:09,301 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-11 20:13:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:13:09,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2024-10-11 20:13:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:13:09,301 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:13:09,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:13:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:13:09,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:13:09,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 20:13:09,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 20:13:09,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 20:13:09,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 20:13:09,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 20:13:09,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 20:13:09,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 20:13:09,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 20:13:09,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 20:13:09,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 20:13:09,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:13:09,307 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:13:09,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:13:09,783 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:13:09,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:13:09 BoogieIcfgContainer [2024-10-11 20:13:09,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:13:09,800 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:13:09,800 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:13:09,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:13:09,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:13:04" (3/4) ... [2024-10-11 20:13:09,802 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:13:09,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2024-10-11 20:13:09,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2024-10-11 20:13:09,809 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 20:13:09,810 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:13:09,810 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:13:09,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:13:09,867 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:13:09,867 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:13:09,868 INFO L158 Benchmark]: Toolchain (without parser) took 6034.52ms. Allocated memory was 159.4MB in the beginning and 283.1MB in the end (delta: 123.7MB). Free memory was 104.6MB in the beginning and 172.1MB in the end (delta: -67.5MB). Peak memory consumption was 57.5MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,868 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:13:09,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.70ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 93.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 159.4MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,869 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 159.4MB. Free memory was 92.0MB in the beginning and 90.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,869 INFO L158 Benchmark]: RCFGBuilder took 242.93ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 78.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,873 INFO L158 Benchmark]: TraceAbstraction took 5466.58ms. Allocated memory was 159.4MB in the beginning and 283.1MB in the end (delta: 123.7MB). Free memory was 78.0MB in the beginning and 176.3MB in the end (delta: -98.3MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,873 INFO L158 Benchmark]: Witness Printer took 67.09ms. Allocated memory is still 283.1MB. Free memory was 176.3MB in the beginning and 172.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:13:09,874 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.13ms. Allocated memory is still 159.4MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.70ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 93.5MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 159.4MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 159.4MB. Free memory was 92.0MB in the beginning and 90.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 242.93ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 78.6MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5466.58ms. Allocated memory was 159.4MB in the beginning and 283.1MB in the end (delta: 123.7MB). Free memory was 78.0MB in the beginning and 176.3MB in the end (delta: -98.3MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 67.09ms. Allocated memory is still 283.1MB. Free memory was 176.3MB in the beginning and 172.1MB 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: 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 - 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 - 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 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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 3 procedures, 44 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 2791 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2061 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 730 mSDtfsCounter, 1097 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 774 GetRequests, 644 SyntacticMatches, 12 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=17, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 202 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1221 ConstructedInterpolants, 0 QuantifiedInterpolants, 2039 SizeOfPredicates, 6 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 1731/1989 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 - ProcedureContractResult [Line: 11]: Procedure Contract for rec1 Derived contract for procedure rec1. Requires: (i <= 2147483647) Ensures: ((i <= 2147483647) && (((\result == 0) && (i <= 0)) || ((\result == 1) && (1 <= i)))) - ProcedureContractResult [Line: 17]: Procedure Contract for rec2 Derived contract for procedure rec2. Requires: (j < 2147483647) Ensures: ((((j <= 0) && (0 <= \result)) || (1 < j)) && (j <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:13:09,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE