./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.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 bf6b5d6ce0125c606cfafa6fb4e25513c25265a3f4d4cd63094ae1ba72acdc4a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:29:38,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:29:38,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:29:38,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:29:38,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:29:38,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:29:38,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:29:38,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:29:38,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:29:38,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:29:38,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:29:38,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:29:38,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:29:38,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:29:38,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:29:38,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:29:38,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:29:38,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:29:38,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:29:38,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:29:38,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:29:38,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:29:38,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:29:38,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:29:38,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:29:38,211 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:29:38,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:29:38,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:29:38,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:29:38,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:29:38,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:29:38,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:29:38,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:29:38,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:29:38,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:29:38,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:29:38,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:29:38,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:29:38,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:29:38,217 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 -> bf6b5d6ce0125c606cfafa6fb4e25513c25265a3f4d4cd63094ae1ba72acdc4a [2024-10-24 20:29:38,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:29:38,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:29:38,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:29:38,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:29:38,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:29:38,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-10-24 20:29:39,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:29:40,000 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:29:40,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-10-24 20:29:40,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196b8aee6/e12d1716a7f242c3900941dcf51beccb/FLAG27191895d [2024-10-24 20:29:40,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/196b8aee6/e12d1716a7f242c3900941dcf51beccb [2024-10-24 20:29:40,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:29:40,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:29:40,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:29:40,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:29:40,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:29:40,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3775ec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40, skipping insertion in model container [2024-10-24 20:29:40,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:29:40,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:29:40,226 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:29:40,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:29:40,252 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:29:40,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40 WrapperNode [2024-10-24 20:29:40,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:29:40,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:29:40,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:29:40,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:29:40,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,279 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-10-24 20:29:40,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:29:40,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:29:40,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:29:40,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:29:40,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,303 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-10-24 20:29:40,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:29:40,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:29:40,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:29:40,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:29:40,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (1/1) ... [2024-10-24 20:29:40,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:29:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:40,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:29:40,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:29:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:29:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:29:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:29:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:29:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:29:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:29:40,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 20:29:40,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 20:29:40,437 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:29:40,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:29:40,644 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-24 20:29:40,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:29:40,667 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:29:40,669 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 20:29:40,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:29:40 BoogieIcfgContainer [2024-10-24 20:29:40,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:29:40,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:29:40,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:29:40,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:29:40,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:29:40" (1/3) ... [2024-10-24 20:29:40,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274de444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:29:40, skipping insertion in model container [2024-10-24 20:29:40,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:40" (2/3) ... [2024-10-24 20:29:40,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274de444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:29:40, skipping insertion in model container [2024-10-24 20:29:40,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:29:40" (3/3) ... [2024-10-24 20:29:40,677 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound1.c [2024-10-24 20:29:40,690 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:29:40,690 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 20:29:40,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:29:40,736 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;@470d86dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:29:40,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 20:29:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 45 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 20:29:40,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:40,746 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:40,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:40,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash -783542553, now seen corresponding path program 1 times [2024-10-24 20:29:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156687009] [2024-10-24 20:29:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:40,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156687009] [2024-10-24 20:29:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156687009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:29:40,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215120993] [2024-10-24 20:29:40,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:40,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 20:29:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 20:29:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:29:40,985 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 45 states have internal predecessors, (51), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:29:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:41,005 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2024-10-24 20:29:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 20:29:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-10-24 20:29:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:41,012 INFO L225 Difference]: With dead ends: 104 [2024-10-24 20:29:41,012 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 20:29:41,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 20:29:41,017 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:41,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 20:29:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 20:29:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 43 states have internal predecessors, (45), 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-10-24 20:29:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-24 20:29:41,052 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2024-10-24 20:29:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-24 20:29:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:29:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-24 20:29:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 20:29:41,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:41,054 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:29:41,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:41,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1613567575, now seen corresponding path program 1 times [2024-10-24 20:29:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635139029] [2024-10-24 20:29:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:41,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:29:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503969592] [2024-10-24 20:29:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:41,109 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-10-24 20:29:41,110 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-10-24 20:29:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:41,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 20:29:41,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:29:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:41,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:29:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635139029] [2024-10-24 20:29:41,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:29:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503969592] [2024-10-24 20:29:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503969592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 20:29:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889090993] [2024-10-24 20:29:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:41,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:29:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:41,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:29:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:29:41,313 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:29:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:41,479 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2024-10-24 20:29:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:29:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2024-10-24 20:29:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:41,481 INFO L225 Difference]: With dead ends: 74 [2024-10-24 20:29:41,481 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 20:29:41,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:29:41,482 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 191 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:41,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 63 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 20:29:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-10-24 20:29:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 52 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-24 20:29:41,489 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2024-10-24 20:29:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:41,490 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-24 20:29:41,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:29:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-24 20:29:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 20:29:41,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:41,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:41,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:29:41,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:41,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:41,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1519012777, now seen corresponding path program 1 times [2024-10-24 20:29:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572648693] [2024-10-24 20:29:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:29:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625210461] [2024-10-24 20:29:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:41,719 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-10-24 20:29:41,722 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-10-24 20:29:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:41,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 20:29:41,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:29:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:41,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:29:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572648693] [2024-10-24 20:29:41,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:29:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625210461] [2024-10-24 20:29:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625210461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:41,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 20:29:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124095850] [2024-10-24 20:29:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 20:29:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 20:29:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:29:41,857 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:29:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:42,002 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-10-24 20:29:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:29:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2024-10-24 20:29:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:42,003 INFO L225 Difference]: With dead ends: 95 [2024-10-24 20:29:42,003 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 20:29:42,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:29:42,004 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:42,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 105 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 20:29:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 20:29:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.435897435897436) internal successors, (56), 50 states have internal predecessors, (56), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-24 20:29:42,010 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 21 [2024-10-24 20:29:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:42,010 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-24 20:29:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:29:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2024-10-24 20:29:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 20:29:42,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:42,011 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 20:29:42,214 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,SelfDestructingSolverStorable2 [2024-10-24 20:29:42,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -155244117, now seen corresponding path program 1 times [2024-10-24 20:29:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583200626] [2024-10-24 20:29:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:42,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:42,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583200626] [2024-10-24 20:29:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583200626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123253324] [2024-10-24 20:29:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:42,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:42,363 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:29:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:42,552 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-24 20:29:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-24 20:29:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:42,553 INFO L225 Difference]: With dead ends: 59 [2024-10-24 20:29:42,554 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 20:29:42,554 INFO L431 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-10-24 20:29:42,555 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:42,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 20:29:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 20:29:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 20:29:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2024-10-24 20:29:42,567 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 22 [2024-10-24 20:29:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:42,567 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2024-10-24 20:29:42,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:29:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2024-10-24 20:29:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 20:29:42,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:42,570 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:42,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 20:29:42,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:42,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash -517600277, now seen corresponding path program 1 times [2024-10-24 20:29:42,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:42,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156789930] [2024-10-24 20:29:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:42,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156789930] [2024-10-24 20:29:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156789930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:42,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293236359] [2024-10-24 20:29:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:42,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:42,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:42,649 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:29:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:42,716 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-10-24 20:29:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:42,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-24 20:29:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:42,717 INFO L225 Difference]: With dead ends: 59 [2024-10-24 20:29:42,717 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 20:29:42,718 INFO L431 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-10-24 20:29:42,718 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 76 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:42,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 76 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 20:29:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 20:29:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-10-24 20:29:42,723 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2024-10-24 20:29:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:42,724 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-10-24 20:29:42,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:29:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-10-24 20:29:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 20:29:42,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:42,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:42,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 20:29:42,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1420767521, now seen corresponding path program 1 times [2024-10-24 20:29:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899316915] [2024-10-24 20:29:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899316915] [2024-10-24 20:29:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899316915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:42,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:42,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415871647] [2024-10-24 20:29:42,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:42,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:42,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:42,830 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:42,869 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-24 20:29:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:42,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-10-24 20:29:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:42,870 INFO L225 Difference]: With dead ends: 59 [2024-10-24 20:29:42,872 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 20:29:42,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:29:42,873 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:42,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 20:29:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 20:29:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 50 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-10-24 20:29:42,881 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 33 [2024-10-24 20:29:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:42,883 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-10-24 20:29:42,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-10-24 20:29:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 20:29:42,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:42,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:42,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:29:42,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:42,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:42,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1094120262, now seen corresponding path program 1 times [2024-10-24 20:29:42,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566574489] [2024-10-24 20:29:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566574489] [2024-10-24 20:29:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566574489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144931565] [2024-10-24 20:29:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:42,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:42,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:42,981 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:43,018 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-24 20:29:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:43,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-10-24 20:29:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:43,020 INFO L225 Difference]: With dead ends: 59 [2024-10-24 20:29:43,022 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 20:29:43,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:29:43,023 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:43,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 74 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 20:29:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 20:29:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 50 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-10-24 20:29:43,032 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 34 [2024-10-24 20:29:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-24 20:29:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-10-24 20:29:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 20:29:43,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:43,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 20:29:43,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 429988456, now seen corresponding path program 1 times [2024-10-24 20:29:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873582535] [2024-10-24 20:29:43,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:43,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873582535] [2024-10-24 20:29:43,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873582535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:43,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:43,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291101679] [2024-10-24 20:29:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:43,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:43,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:43,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:43,105 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:43,148 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2024-10-24 20:29:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-10-24 20:29:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:43,165 INFO L225 Difference]: With dead ends: 61 [2024-10-24 20:29:43,165 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 20:29:43,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:29:43,168 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:43,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 71 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 20:29:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-24 20:29:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.325) internal successors, (53), 51 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-24 20:29:43,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 37 [2024-10-24 20:29:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:43,177 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-24 20:29:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-24 20:29:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 20:29:43,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:43,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:43,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 20:29:43,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash 444740330, now seen corresponding path program 1 times [2024-10-24 20:29:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180851025] [2024-10-24 20:29:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180851025] [2024-10-24 20:29:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180851025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:43,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:29:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784168620] [2024-10-24 20:29:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:43,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:29:43,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:29:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:29:43,246 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:43,316 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-24 20:29:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:29:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-24 20:29:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:43,317 INFO L225 Difference]: With dead ends: 61 [2024-10-24 20:29:43,317 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 20:29:43,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:29:43,318 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:43,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 72 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 20:29:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-24 20:29:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 52 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-24 20:29:43,330 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2024-10-24 20:29:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-24 20:29:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 20:29:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-24 20:29:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 20:29:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:43,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:43,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 20:29:43,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:43,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 902048426, now seen corresponding path program 1 times [2024-10-24 20:29:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:43,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149677927] [2024-10-24 20:29:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149677927] [2024-10-24 20:29:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149677927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:29:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232125089] [2024-10-24 20:29:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:29:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:29:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:29:43,424 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 20:29:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:43,476 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-10-24 20:29:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:29:43,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 39 [2024-10-24 20:29:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:43,477 INFO L225 Difference]: With dead ends: 66 [2024-10-24 20:29:43,479 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 20:29:43,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:29:43,480 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:43,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 69 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 20:29:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-10-24 20:29:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 50 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-10-24 20:29:43,488 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 39 [2024-10-24 20:29:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-24 20:29:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 20:29:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-10-24 20:29:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 20:29:43,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:43,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:43,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 20:29:43,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:43,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2101269780, now seen corresponding path program 1 times [2024-10-24 20:29:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470865618] [2024-10-24 20:29:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 20:29:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470865618] [2024-10-24 20:29:43,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470865618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:29:43,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:29:43,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 20:29:43,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141363539] [2024-10-24 20:29:43,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:29:43,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:29:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:29:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:29:43,567 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-10-24 20:29:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:43,621 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-10-24 20:29:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:29:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 40 [2024-10-24 20:29:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:43,622 INFO L225 Difference]: With dead ends: 58 [2024-10-24 20:29:43,622 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 20:29:43,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:29:43,623 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:43,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:29:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 20:29:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 20:29:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 48 states have internal predecessors, (50), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:29:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-10-24 20:29:43,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 40 [2024-10-24 20:29:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:43,629 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-10-24 20:29:43,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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-10-24 20:29:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-10-24 20:29:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 20:29:43,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:43,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 20:29:43,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -685627986, now seen corresponding path program 1 times [2024-10-24 20:29:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207609748] [2024-10-24 20:29:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:29:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249458077] [2024-10-24 20:29:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:43,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:43,645 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-10-24 20:29:43,646 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-10-24 20:29:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:43,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 20:29:43,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:29:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:29:43,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:29:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207609748] [2024-10-24 20:29:45,844 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:29:45,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249458077] [2024-10-24 20:29:45,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249458077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:29:45,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:29:45,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-24 20:29:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928612724] [2024-10-24 20:29:45,844 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:29:45,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 20:29:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:45,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 20:29:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-24 20:29:45,845 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:29:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:46,009 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-10-24 20:29:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 20:29:46,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-10-24 20:29:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:46,010 INFO L225 Difference]: With dead ends: 73 [2024-10-24 20:29:46,010 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 20:29:46,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-24 20:29:46,011 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:46,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 93 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 20:29:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 20:29:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 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-10-24 20:29:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-24 20:29:46,014 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 42 [2024-10-24 20:29:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:46,015 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-24 20:29:46,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:29:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-24 20:29:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 20:29:46,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:46,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:46,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 20:29:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:46,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1758496656, now seen corresponding path program 1 times [2024-10-24 20:29:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054445255] [2024-10-24 20:29:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 20:29:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:29:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:29:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 20:29:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:29:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:29:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054445255] [2024-10-24 20:29:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054445255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:29:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748828174] [2024-10-24 20:29:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:46,377 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-10-24 20:29:46,379 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-10-24 20:29:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:46,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 20:29:46,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:29:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:29:46,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:29:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:29:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748828174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:29:46,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:29:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-24 20:29:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664506830] [2024-10-24 20:29:46,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:29:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 20:29:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:29:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 20:29:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:29:46,610 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 20:29:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:29:46,756 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-10-24 20:29:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 20:29:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 44 [2024-10-24 20:29:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:29:46,757 INFO L225 Difference]: With dead ends: 39 [2024-10-24 20:29:46,757 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 20:29:46,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 20:29:46,758 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:29:46,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 105 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:29:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 20:29:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 20:29:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 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-10-24 20:29:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-24 20:29:46,762 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 44 [2024-10-24 20:29:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:29:46,763 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-24 20:29:46,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-24 20:29:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-24 20:29:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 20:29:46,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:29:46,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:29:46,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 20:29:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:46,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-24 20:29:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:29:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1321178566, now seen corresponding path program 1 times [2024-10-24 20:29:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:29:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485105808] [2024-10-24 20:29:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:29:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:29:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194440268] [2024-10-24 20:29:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:29:46,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:29:46,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:29:46,984 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-10-24 20:29:46,985 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-10-24 20:29:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:29:47,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 20:29:47,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:29:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 20:29:47,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:30:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:30:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485105808] [2024-10-24 20:30:04,734 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:30:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194440268] [2024-10-24 20:30:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194440268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:30:04,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:30:04,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-24 20:30:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191674163] [2024-10-24 20:30:04,735 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:30:04,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 20:30:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:30:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 20:30:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=161, Unknown=4, NotChecked=0, Total=210 [2024-10-24 20:30:04,736 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:30:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:30:04,938 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-10-24 20:30:04,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 20:30:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2024-10-24 20:30:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:30:04,940 INFO L225 Difference]: With dead ends: 38 [2024-10-24 20:30:04,940 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:30:04,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=83, Invalid=255, Unknown=4, NotChecked=0, Total=342 [2024-10-24 20:30:04,941 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:30:04,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 93 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:30:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:30:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:30:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:30:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:30:04,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-24 20:30:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:30:04,942 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:30:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 20:30:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:30:04,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:30:04,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-24 20:30:04,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-24 20:30:04,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-24 20:30:04,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-24 20:30:04,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-24 20:30:04,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-24 20:30:04,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-24 20:30:04,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-24 20:30:04,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-24 20:30:04,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-24 20:30:04,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-24 20:30:04,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 20:30:05,149 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,SelfDestructingSolverStorable13 [2024-10-24 20:30:05,153 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:30:05,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:30:05,292 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:30:05,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:30:05 BoogieIcfgContainer [2024-10-24 20:30:05,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:30:05,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:30:05,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:30:05,320 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:30:05,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:29:40" (3/4) ... [2024-10-24 20:30:05,322 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:30:05,325 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 20:30:05,325 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-24 20:30:05,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 20:30:05,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 20:30:05,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:30:05,331 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:30:05,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:30:05,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:30:05,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:30:05,422 INFO L158 Benchmark]: Toolchain (without parser) took 25383.93ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 109.8MB in the beginning and 81.0MB in the end (delta: 28.7MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,422 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:30:05,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.06ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 97.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.05ms. Allocated memory is still 151.0MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:30:05,423 INFO L158 Benchmark]: Boogie Preprocessor took 30.15ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 94.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,423 INFO L158 Benchmark]: RCFGBuilder took 358.56ms. Allocated memory is still 151.0MB. Free memory was 94.1MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,424 INFO L158 Benchmark]: TraceAbstraction took 24648.70ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 78.8MB in the beginning and 86.3MB in the end (delta: -7.5MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,424 INFO L158 Benchmark]: Witness Printer took 101.45ms. Allocated memory is still 222.3MB. Free memory was 86.3MB in the beginning and 81.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 20:30:05,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.06ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 97.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.05ms. Allocated memory is still 151.0MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.15ms. Allocated memory is still 151.0MB. Free memory was 96.1MB in the beginning and 94.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.56ms. Allocated memory is still 151.0MB. Free memory was 94.1MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24648.70ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 78.8MB in the beginning and 86.3MB in the end (delta: -7.5MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 101.45ms. Allocated memory is still 222.3MB. Free memory was 86.3MB in the beginning and 81.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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, 53 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 656 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1017 IncrementalHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 412 mSDtfsCounter, 1017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 2373 SizeOfPredicates, 13 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 162/211 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 16 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((b == 1) && (0 <= x)) && (a <= 1)) && (y == 1)) && (x <= 1)) && (z == 0)) && (0 <= a)) || ((((((((((b == 1) && (((__int128) y + 1) != 0)) && (a <= 1)) && (z <= 1)) && (((x >= 0) ? (x % 2) : ((x % 2) + 2)) == 0)) && (((((__int128) -1 * x) >= 0) ? (((__int128) -1 * x) / 2) : ((((__int128) -1 * x) / 2) - 1)) <= 0)) && (y <= 0)) && (0 <= a)) && (0 <= z)) && (0 <= ((__int128) y + 1)))) - ProcedureContractResult [Line: 9]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:30:05,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE