./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:20:09,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:20:09,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:20:09,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:20:09,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:20:09,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:20:09,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:20:09,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:20:09,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:20:09,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:20:09,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:20:09,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:20:09,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:20:09,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:20:09,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:20:09,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:20:09,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:20:09,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:20:09,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:20:09,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:20:09,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:20:09,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:20:09,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:20:09,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:20:09,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:20:09,891 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:20:09,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:20:09,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:20:09,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:20:09,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:20:09,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:20:09,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:20:09,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:20:09,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:20:09,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:20:09,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:20:09,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:20:09,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:20:09,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:20:09,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:20:09,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:20:09,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:20:09,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:20:09,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:20:09,896 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 [2024-11-12 17:20:10,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:20:10,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:20:10,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:20:10,210 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:20:10,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:20:10,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2024-11-12 17:20:11,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:20:11,828 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:20:11,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2024-11-12 17:20:11,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74d30bc4c/a50a3cae72c64f8eadda059c5bc3b3a6/FLAGa925b51b2 [2024-11-12 17:20:11,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74d30bc4c/a50a3cae72c64f8eadda059c5bc3b3a6 [2024-11-12 17:20:11,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:20:11,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:20:11,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:20:11,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:20:11,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:20:11,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:20:11" (1/1) ... [2024-11-12 17:20:11,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2969eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:11, skipping insertion in model container [2024-11-12 17:20:11,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:20:11" (1/1) ... [2024-11-12 17:20:11,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:20:12,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:20:12,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:20:12,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:20:12,113 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:20:12,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12 WrapperNode [2024-11-12 17:20:12,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:20:12,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:20:12,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:20:12,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:20:12,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,148 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2024-11-12 17:20:12,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:20:12,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:20:12,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:20:12,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:20:12,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 17:20:12,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:20:12,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:20:12,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:20:12,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:20:12,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (1/1) ... [2024-11-12 17:20:12,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:20:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:12,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:20:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:20:12,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:20:12,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 17:20:12,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 17:20:12,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:20:12,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:20:12,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:20:12,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 17:20:12,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 17:20:12,321 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:20:12,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:20:12,644 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-12 17:20:12,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:20:12,666 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:20:12,667 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 17:20:12,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:20:12 BoogieIcfgContainer [2024-11-12 17:20:12,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:20:12,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:20:12,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:20:12,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:20:12,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:20:11" (1/3) ... [2024-11-12 17:20:12,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f97e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:20:12, skipping insertion in model container [2024-11-12 17:20:12,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:20:12" (2/3) ... [2024-11-12 17:20:12,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f97e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:20:12, skipping insertion in model container [2024-11-12 17:20:12,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:20:12" (3/3) ... [2024-11-12 17:20:12,679 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound1.c [2024-11-12 17:20:12,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:20:12,697 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2024-11-12 17:20:12,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:20:12,795 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;@5282ecc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:20:12,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-12 17:20:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:20:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 17:20:12,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:12,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 17:20:12,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2024-11-12 17:20:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:12,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756063185] [2024-11-12 17:20:12,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:20:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756063185] [2024-11-12 17:20:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756063185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111900631] [2024-11-12 17:20:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:13,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:13,038 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 133 states have internal predecessors, (139), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:13,134 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2024-11-12 17:20:13,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 17:20:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:13,146 INFO L225 Difference]: With dead ends: 257 [2024-11-12 17:20:13,146 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 17:20:13,150 INFO L434 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-11-12 17:20:13,153 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:13,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 17:20:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 17:20:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.7142857142857142) internal successors, (120), 117 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2024-11-12 17:20:13,194 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 3 [2024-11-12 17:20:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:13,195 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2024-11-12 17:20:13,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2024-11-12 17:20:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 17:20:13,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:13,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 17:20:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:20:13,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:13,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2024-11-12 17:20:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223250142] [2024-11-12 17:20:13,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:20:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223250142] [2024-11-12 17:20:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223250142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080365780] [2024-11-12 17:20:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:13,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:13,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:13,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:13,257 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:13,311 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2024-11-12 17:20:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 17:20:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:13,313 INFO L225 Difference]: With dead ends: 123 [2024-11-12 17:20:13,313 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 17:20:13,314 INFO L434 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-11-12 17:20:13,315 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:13,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 17:20:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-12 17:20:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-12 17:20:13,328 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 4 [2024-11-12 17:20:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:13,328 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-12 17:20:13,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-12 17:20:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:20:13,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:13,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:13,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:20:13,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:13,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2024-11-12 17:20:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621189104] [2024-11-12 17:20:13,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:13,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928864241] [2024-11-12 17:20:13,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:13,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:13,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:13,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:20:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:13,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:20:13,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:20:13,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:20:13,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621189104] [2024-11-12 17:20:13,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928864241] [2024-11-12 17:20:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928864241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:13,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638296031] [2024-11-12 17:20:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:13,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:13,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:13,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:13,485 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:13,529 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-12 17:20:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 17:20:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:13,531 INFO L225 Difference]: With dead ends: 119 [2024-11-12 17:20:13,531 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 17:20:13,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-12 17:20:13,532 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:13,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 205 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 17:20:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 17:20:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-12 17:20:13,547 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 8 [2024-11-12 17:20:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-12 17:20:13,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:20:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-12 17:20:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 17:20:13,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:13,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:13,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:13,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:13,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:13,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1367701482, now seen corresponding path program 1 times [2024-11-12 17:20:13,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145934904] [2024-11-12 17:20:13,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316836091] [2024-11-12 17:20:13,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:13,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:13,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:13,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:20:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:13,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:20:13,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:13,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:20:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:13,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145934904] [2024-11-12 17:20:13,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:13,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316836091] [2024-11-12 17:20:13,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316836091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:13,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:13,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353646791] [2024-11-12 17:20:13,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:13,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:13,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:13,930 INFO L87 Difference]: Start difference. First operand 117 states and 120 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:13,963 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2024-11-12 17:20:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:13,965 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-12 17:20:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:13,968 INFO L225 Difference]: With dead ends: 117 [2024-11-12 17:20:13,968 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 17:20:13,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-11-12 17:20:13,969 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 86 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:13,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 114 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 17:20:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 17:20:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.6) internal successors, (112), 109 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2024-11-12 17:20:13,982 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 25 [2024-11-12 17:20:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:13,983 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2024-11-12 17:20:13,983 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2024-11-12 17:20:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 17:20:13,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:13,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:13,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 17:20:14,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-12 17:20:14,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -550926956, now seen corresponding path program 1 times [2024-11-12 17:20:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654278577] [2024-11-12 17:20:14,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654278577] [2024-11-12 17:20:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654278577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:20:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982446465] [2024-11-12 17:20:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:14,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:14,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:20:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:14,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:20:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:14,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:20:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982446465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:20:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 17:20:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109934398] [2024-11-12 17:20:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:20:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:20:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:20:14,894 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,031 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2024-11-12 17:20:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:20:15,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-12 17:20:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,033 INFO L225 Difference]: With dead ends: 115 [2024-11-12 17:20:15,033 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 17:20:15,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:20:15,034 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 389 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 17:20:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-12 17:20:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 107 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2024-11-12 17:20:15,048 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 26 [2024-11-12 17:20:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,052 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2024-11-12 17:20:15,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2024-11-12 17:20:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:20:15,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,053 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 17:20:15,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:20:15,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:15,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1159825162, now seen corresponding path program 1 times [2024-11-12 17:20:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:15,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042346513] [2024-11-12 17:20:15,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:15,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:15,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042346513] [2024-11-12 17:20:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042346513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:15,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:15,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:20:15,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430430573] [2024-11-12 17:20:15,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:15,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:20:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:15,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:20:15,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:15,355 INFO L87 Difference]: Start difference. First operand 113 states and 116 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,378 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2024-11-12 17:20:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:20:15,379 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-12 17:20:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,380 INFO L225 Difference]: With dead ends: 113 [2024-11-12 17:20:15,380 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 17:20:15,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:15,382 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 17:20:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 17:20:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 106 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2024-11-12 17:20:15,394 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 28 [2024-11-12 17:20:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2024-11-12 17:20:15,395 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2024-11-12 17:20:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 17:20:15,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,396 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 17:20:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 17:20:15,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1594841583, now seen corresponding path program 1 times [2024-11-12 17:20:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895822807] [2024-11-12 17:20:15,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895822807] [2024-11-12 17:20:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895822807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:20:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347788569] [2024-11-12 17:20:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:20:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:20:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:15,473 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,496 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2024-11-12 17:20:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:20:15,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-12 17:20:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,498 INFO L225 Difference]: With dead ends: 145 [2024-11-12 17:20:15,498 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 17:20:15,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:15,499 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 17:20:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-12 17:20:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.527027027027027) internal successors, (113), 110 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2024-11-12 17:20:15,505 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 29 [2024-11-12 17:20:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,506 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2024-11-12 17:20:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2024-11-12 17:20:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 17:20:15,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,506 INFO L218 NwaCegarLoop]: trace histogram [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-11-12 17:20:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 17:20:15,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 660565843, now seen corresponding path program 1 times [2024-11-12 17:20:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147003079] [2024-11-12 17:20:15,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147003079] [2024-11-12 17:20:15,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147003079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:15,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:15,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24901499] [2024-11-12 17:20:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:15,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:15,565 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,603 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2024-11-12 17:20:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-12 17:20:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,605 INFO L225 Difference]: With dead ends: 118 [2024-11-12 17:20:15,605 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 17:20:15,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-12 17:20:15,609 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 159 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 17:20:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-12 17:20:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 75 states have (on average 1.52) internal successors, (114), 111 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2024-11-12 17:20:15,619 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 31 [2024-11-12 17:20:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2024-11-12 17:20:15,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2024-11-12 17:20:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 17:20:15,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:20:15,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -997295267, now seen corresponding path program 1 times [2024-11-12 17:20:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984809345] [2024-11-12 17:20:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984809345] [2024-11-12 17:20:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984809345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:15,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:20:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599358426] [2024-11-12 17:20:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:20:15,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:20:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:15,680 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,763 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2024-11-12 17:20:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:20:15,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-12 17:20:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,764 INFO L225 Difference]: With dead ends: 119 [2024-11-12 17:20:15,764 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 17:20:15,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-12 17:20:15,766 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 214 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 17:20:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-12 17:20:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.513157894736842) internal successors, (115), 112 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2024-11-12 17:20:15,775 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 32 [2024-11-12 17:20:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,775 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2024-11-12 17:20:15,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2024-11-12 17:20:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 17:20:15,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 17:20:15,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash -851382123, now seen corresponding path program 1 times [2024-11-12 17:20:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501448162] [2024-11-12 17:20:15,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:15,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354955346] [2024-11-12 17:20:15,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:15,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:20:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:15,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:20:15,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:15,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:20:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501448162] [2024-11-12 17:20:15,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354955346] [2024-11-12 17:20:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354955346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093499277] [2024-11-12 17:20:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:15,896 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:15,954 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2024-11-12 17:20:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-12 17:20:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:15,957 INFO L225 Difference]: With dead ends: 154 [2024-11-12 17:20:15,957 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 17:20:15,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-11-12 17:20:15,958 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:15,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 17:20:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2024-11-12 17:20:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 113 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2024-11-12 17:20:15,966 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 33 [2024-11-12 17:20:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:15,966 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2024-11-12 17:20:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2024-11-12 17:20:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 17:20:15,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:15,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:15,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 17:20:16,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:16,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:16,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -623041953, now seen corresponding path program 1 times [2024-11-12 17:20:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443166870] [2024-11-12 17:20:16,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443166870] [2024-11-12 17:20:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443166870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:20:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708003441] [2024-11-12 17:20:16,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:16,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:16,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:16,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:20:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:16,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 17:20:16,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:16,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:20:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708003441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:20:16,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:20:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-12 17:20:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976751762] [2024-11-12 17:20:16,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:20:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 17:20:16,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 17:20:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:20:16,846 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:20:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:17,087 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2024-11-12 17:20:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:20:17,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-12 17:20:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:17,090 INFO L225 Difference]: With dead ends: 154 [2024-11-12 17:20:17,090 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 17:20:17,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-12 17:20:17,091 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 217 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:17,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 573 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:20:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 17:20:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 120. [2024-11-12 17:20:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.5) internal successors, (117), 114 states have internal predecessors, (117), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2024-11-12 17:20:17,097 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 34 [2024-11-12 17:20:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:17,098 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2024-11-12 17:20:17,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:20:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2024-11-12 17:20:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 17:20:17,100 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:17,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:17,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 17:20:17,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1742859935, now seen corresponding path program 1 times [2024-11-12 17:20:17,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:17,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266849587] [2024-11-12 17:20:17,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:17,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570298493] [2024-11-12 17:20:17,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:17,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:17,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:20:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:17,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 17:20:17,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:17,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:20:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266849587] [2024-11-12 17:20:17,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:17,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570298493] [2024-11-12 17:20:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570298493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:20:17,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:20:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-12 17:20:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527279010] [2024-11-12 17:20:17,667 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 17:20:17,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:20:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:20:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:20:17,668 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:20:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:18,901 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2024-11-12 17:20:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 17:20:18,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-12 17:20:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:18,902 INFO L225 Difference]: With dead ends: 198 [2024-11-12 17:20:18,903 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 17:20:18,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:20:18,903 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 217 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:18,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 303 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 17:20:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 17:20:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2024-11-12 17:20:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.512) internal successors, (189), 161 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:20:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2024-11-12 17:20:18,917 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 36 [2024-11-12 17:20:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2024-11-12 17:20:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:20:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2024-11-12 17:20:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 17:20:18,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:18,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:18,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:19,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 148850787, now seen corresponding path program 1 times [2024-11-12 17:20:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054846412] [2024-11-12 17:20:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461969547] [2024-11-12 17:20:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:19,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:19,136 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:20:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:20:19,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:19,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:20:19,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:19,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054846412] [2024-11-12 17:20:19,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:19,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461969547] [2024-11-12 17:20:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461969547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:19,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:20:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084465578] [2024-11-12 17:20:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:19,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:20:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:19,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:20:19,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:20:19,202 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:19,308 INFO L93 Difference]: Finished difference Result 286 states and 346 transitions. [2024-11-12 17:20:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:20:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-12 17:20:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:19,311 INFO L225 Difference]: With dead ends: 286 [2024-11-12 17:20:19,311 INFO L226 Difference]: Without dead ends: 257 [2024-11-12 17:20:19,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-11-12 17:20:19,311 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:19,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 148 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-12 17:20:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2024-11-12 17:20:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.4795918367346939) internal successors, (290), 232 states have internal predecessors, (290), 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-11-12 17:20:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 302 transitions. [2024-11-12 17:20:19,326 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 302 transitions. Word has length 38 [2024-11-12 17:20:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 302 transitions. [2024-11-12 17:20:19,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:20:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 302 transitions. [2024-11-12 17:20:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 17:20:19,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:19,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:19,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 17:20:19,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:19,532 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:19,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash -671097975, now seen corresponding path program 1 times [2024-11-12 17:20:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107746503] [2024-11-12 17:20:19,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107746503] [2024-11-12 17:20:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107746503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:20:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906301118] [2024-11-12 17:20:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:20:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:20:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:19,605 INFO L87 Difference]: Start difference. First operand 241 states and 302 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:19,737 INFO L93 Difference]: Finished difference Result 241 states and 302 transitions. [2024-11-12 17:20:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:20:19,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-12 17:20:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:19,738 INFO L225 Difference]: With dead ends: 241 [2024-11-12 17:20:19,739 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 17:20:19,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:20:19,739 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:19,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 188 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 17:20:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-12 17:20:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 231 states have internal predecessors, (286), 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-11-12 17:20:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2024-11-12 17:20:19,751 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 56 [2024-11-12 17:20:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:19,751 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2024-11-12 17:20:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2024-11-12 17:20:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 17:20:19,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:19,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:19,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 17:20:19,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:19,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -671098295, now seen corresponding path program 1 times [2024-11-12 17:20:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:19,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398598047] [2024-11-12 17:20:19,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398598047] [2024-11-12 17:20:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398598047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:20:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156088781] [2024-11-12 17:20:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:20:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:20:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:19,825 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:19,981 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2024-11-12 17:20:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:20:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-12 17:20:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:19,984 INFO L225 Difference]: With dead ends: 256 [2024-11-12 17:20:19,984 INFO L226 Difference]: Without dead ends: 255 [2024-11-12 17:20:19,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:19,985 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:19,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 197 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-12 17:20:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2024-11-12 17:20:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 231 states have internal predecessors, (284), 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-11-12 17:20:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 296 transitions. [2024-11-12 17:20:19,997 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 296 transitions. Word has length 56 [2024-11-12 17:20:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:19,998 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 296 transitions. [2024-11-12 17:20:19,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 296 transitions. [2024-11-12 17:20:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 17:20:19,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:19,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 17:20:19,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 670799390, now seen corresponding path program 1 times [2024-11-12 17:20:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898135286] [2024-11-12 17:20:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898135286] [2024-11-12 17:20:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898135286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:20,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:20,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:20:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948576530] [2024-11-12 17:20:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:20:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:20:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:20:20,060 INFO L87 Difference]: Start difference. First operand 240 states and 296 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:20,199 INFO L93 Difference]: Finished difference Result 263 states and 323 transitions. [2024-11-12 17:20:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:20:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-12 17:20:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:20,201 INFO L225 Difference]: With dead ends: 263 [2024-11-12 17:20:20,201 INFO L226 Difference]: Without dead ends: 259 [2024-11-12 17:20:20,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:20,201 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:20,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 191 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-12 17:20:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2024-11-12 17:20:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.402061855670103) internal successors, (272), 225 states have internal predecessors, (272), 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-11-12 17:20:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2024-11-12 17:20:20,212 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 57 [2024-11-12 17:20:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:20,212 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2024-11-12 17:20:20,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2024-11-12 17:20:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 17:20:20,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:20,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:20,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 17:20:20,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:20,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:20,214 INFO L85 PathProgramCache]: Analyzing trace with hash 670789460, now seen corresponding path program 1 times [2024-11-12 17:20:20,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:20,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588905107] [2024-11-12 17:20:20,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588905107] [2024-11-12 17:20:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588905107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:20:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651370480] [2024-11-12 17:20:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:20:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:20:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:20,286 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:20,477 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2024-11-12 17:20:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:20:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2024-11-12 17:20:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:20,479 INFO L225 Difference]: With dead ends: 242 [2024-11-12 17:20:20,479 INFO L226 Difference]: Without dead ends: 241 [2024-11-12 17:20:20,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:20:20,480 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 138 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:20,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 164 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 17:20:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-12 17:20:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234. [2024-11-12 17:20:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 225 states have internal predecessors, (270), 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-11-12 17:20:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2024-11-12 17:20:20,492 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 57 [2024-11-12 17:20:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2024-11-12 17:20:20,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2024-11-12 17:20:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 17:20:20,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:20,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:20,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 17:20:20,493 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:20,494 INFO L85 PathProgramCache]: Analyzing trace with hash -825338779, now seen corresponding path program 1 times [2024-11-12 17:20:20,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:20,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719430592] [2024-11-12 17:20:20,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:20,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719430592] [2024-11-12 17:20:20,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719430592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:20,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:20,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:20:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573348508] [2024-11-12 17:20:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:20,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:20:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:20:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:20,557 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:20,605 INFO L93 Difference]: Finished difference Result 291 states and 347 transitions. [2024-11-12 17:20:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:20:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2024-11-12 17:20:20,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:20,607 INFO L225 Difference]: With dead ends: 291 [2024-11-12 17:20:20,607 INFO L226 Difference]: Without dead ends: 290 [2024-11-12 17:20:20,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:20:20,608 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 82 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:20,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 407 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-12 17:20:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 233. [2024-11-12 17:20:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 224 states have internal predecessors, (267), 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-11-12 17:20:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2024-11-12 17:20:20,620 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 62 [2024-11-12 17:20:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:20,620 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2024-11-12 17:20:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2024-11-12 17:20:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 17:20:20,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:20,621 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 17:20:20,621 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:20,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1418385575, now seen corresponding path program 1 times [2024-11-12 17:20:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:20,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820332016] [2024-11-12 17:20:20,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:20,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:20,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820332016] [2024-11-12 17:20:20,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820332016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:20:20,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:20:20,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:20:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511925006] [2024-11-12 17:20:20,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:20:20,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:20:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:20:20,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:20:20,722 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:20,858 INFO L93 Difference]: Finished difference Result 283 states and 335 transitions. [2024-11-12 17:20:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:20:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2024-11-12 17:20:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:20,861 INFO L225 Difference]: With dead ends: 283 [2024-11-12 17:20:20,861 INFO L226 Difference]: Without dead ends: 282 [2024-11-12 17:20:20,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:20:20,862 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:20,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:20:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-12 17:20:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 238. [2024-11-12 17:20:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 229 states have internal predecessors, (272), 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-11-12 17:20:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2024-11-12 17:20:20,879 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 64 [2024-11-12 17:20:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2024-11-12 17:20:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:20:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2024-11-12 17:20:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 17:20:20,880 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:20,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 17:20:20,881 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -836399119, now seen corresponding path program 1 times [2024-11-12 17:20:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:20,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942864926] [2024-11-12 17:20:20,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 17:20:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:20:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:20:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942864926] [2024-11-12 17:20:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942864926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:20:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273626106] [2024-11-12 17:20:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:20,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:20,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 17:20:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:21,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:20:21,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:21,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:20:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273626106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:20:21,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:20:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2024-11-12 17:20:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468871619] [2024-11-12 17:20:21,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:20:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:20:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:20:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:20:21,222 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 17:20:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:21,262 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2024-11-12 17:20:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:20:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2024-11-12 17:20:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:21,263 INFO L225 Difference]: With dead ends: 293 [2024-11-12 17:20:21,263 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 17:20:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:20:21,266 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 37 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:21,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 183 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 17:20:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 17:20:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.10752688172043) internal successors, (103), 103 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2024-11-12 17:20:21,276 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 64 [2024-11-12 17:20:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2024-11-12 17:20:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 17:20:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2024-11-12 17:20:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 17:20:21,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:21,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:21,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:21,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:21,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1236701769, now seen corresponding path program 1 times [2024-11-12 17:20:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693776322] [2024-11-12 17:20:21,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284083697] [2024-11-12 17:20:21,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:21,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:21,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:21,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:21,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 17:20:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:21,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 17:20:21,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:21,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:20:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 17:20:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693776322] [2024-11-12 17:20:22,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284083697] [2024-11-12 17:20:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284083697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:20:22,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:20:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 17:20:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339307774] [2024-11-12 17:20:22,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:20:22,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:20:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:22,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:20:22,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:20:22,226 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:20:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:23,212 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2024-11-12 17:20:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:20:23,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 67 [2024-11-12 17:20:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:23,214 INFO L225 Difference]: With dead ends: 109 [2024-11-12 17:20:23,214 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 17:20:23,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:20:23,214 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 146 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:23,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 317 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 17:20:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 17:20:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 17:20:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 74 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:20:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2024-11-12 17:20:23,220 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 67 [2024-11-12 17:20:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2024-11-12 17:20:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 17:20:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2024-11-12 17:20:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 17:20:23,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:20:23,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:23,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:23,422 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2024-11-12 17:20:23,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:20:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash -232686047, now seen corresponding path program 1 times [2024-11-12 17:20:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:20:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332042653] [2024-11-12 17:20:23,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:20:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 17:20:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236994553] [2024-11-12 17:20:23,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:20:23,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:20:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:20:23,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:20:23,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 17:20:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:20:23,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:20:23,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:20:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:23,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:20:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 17:20:23,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:20:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332042653] [2024-11-12 17:20:23,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 17:20:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236994553] [2024-11-12 17:20:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236994553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:20:23,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 17:20:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 17:20:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189378626] [2024-11-12 17:20:23,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 17:20:23,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:20:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:20:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:20:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:20:23,657 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 17:20:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:20:23,721 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2024-11-12 17:20:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:20:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2024-11-12 17:20:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:20:23,722 INFO L225 Difference]: With dead ends: 80 [2024-11-12 17:20:23,722 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:20:23,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:20:23,723 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:20:23,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:20:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:20:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:20:23,724 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-11-12 17:20:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:20:23,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-11-12 17:20:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:20:23,724 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:20:23,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-12 17:20:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:20:23,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:20:23,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 58 remaining) [2024-11-12 17:20:23,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 58 remaining) [2024-11-12 17:20:23,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 58 remaining) [2024-11-12 17:20:23,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 58 remaining) [2024-11-12 17:20:23,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 58 remaining) [2024-11-12 17:20:23,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 58 remaining) [2024-11-12 17:20:23,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 58 remaining) [2024-11-12 17:20:23,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 58 remaining) [2024-11-12 17:20:23,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 58 remaining) [2024-11-12 17:20:23,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 58 remaining) [2024-11-12 17:20:23,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 58 remaining) [2024-11-12 17:20:23,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 58 remaining) [2024-11-12 17:20:23,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 58 remaining) [2024-11-12 17:20:23,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 58 remaining) [2024-11-12 17:20:23,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 58 remaining) [2024-11-12 17:20:23,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 58 remaining) [2024-11-12 17:20:23,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 58 remaining) [2024-11-12 17:20:23,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 58 remaining) [2024-11-12 17:20:23,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 58 remaining) [2024-11-12 17:20:23,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 58 remaining) [2024-11-12 17:20:23,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 58 remaining) [2024-11-12 17:20:23,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 58 remaining) [2024-11-12 17:20:23,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 58 remaining) [2024-11-12 17:20:23,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 17:20:23,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-12 17:20:23,945 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:20:23,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:20:26,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:20:26,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:20:26,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-12 17:20:26,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:20:26 BoogieIcfgContainer [2024-11-12 17:20:26,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:20:26,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:20:26,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:20:26,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:20:26,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:20:12" (3/4) ... [2024-11-12 17:20:26,918 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:20:26,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 17:20:26,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-12 17:20:26,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 17:20:26,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 17:20:26,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:20:26,930 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:20:27,028 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:20:27,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:20:27,029 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:20:27,030 INFO L158 Benchmark]: Toolchain (without parser) took 15180.07ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 136.1MB in the beginning and 134.2MB in the end (delta: 2.0MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-11-12 17:20:27,030 INFO L158 Benchmark]: CDTParser took 1.12ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 82.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:20:27,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.46ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 123.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 17:20:27,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.36ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 121.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:20:27,031 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 172.0MB. Free memory was 121.4MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:20:27,031 INFO L158 Benchmark]: RCFGBuilder took 480.86ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 98.4MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 17:20:27,031 INFO L158 Benchmark]: TraceAbstraction took 14243.69ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 97.5MB in the beginning and 140.5MB in the end (delta: -42.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:20:27,031 INFO L158 Benchmark]: Witness Printer took 115.28ms. Allocated memory is still 207.6MB. Free memory was 140.5MB in the beginning and 134.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 17:20:27,033 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 82.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.46ms. Allocated memory is still 172.0MB. Free memory was 136.1MB in the beginning and 123.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.36ms. Allocated memory is still 172.0MB. Free memory was 122.7MB in the beginning and 121.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 172.0MB. Free memory was 121.4MB in the beginning and 119.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.86ms. Allocated memory is still 172.0MB. Free memory was 119.7MB in the beginning and 98.4MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14243.69ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 97.5MB in the beginning and 140.5MB in the end (delta: -42.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 115.28ms. Allocated memory is still 207.6MB. Free memory was 140.5MB in the beginning and 134.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: 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, 140 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1639 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1620 mSDsluCounter, 5256 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3308 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2257 IncrementalHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1948 mSDtfsCounter, 2257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 683 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=13, InterpolantAutomatonStates: 107, 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, 22 MinimizatonAttempts, 246 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1208 ConstructedInterpolants, 15 QuantifiedInterpolants, 5976 SizeOfPredicates, 7 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 103/143 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 58 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (counter == 1)) && (0 <= A)) || ((((((((0 <= (((__int128) A + r) + 6917529027641081856)) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && ((((((__int128) -3 + u) >= 0) ? (((__int128) -3 + u) / 2) : ((((__int128) -3 + u) / 2) - 1)) * ((((__int128) -3 + u) >= 0) ? (((__int128) -3 + u) / 2) : ((((__int128) -3 + u) / 2) - 1))) <= ((__int128) u + 2147483642))) && (A <= 2147483647)) && (counter == 1)) && (0 <= A))) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:20:27,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE