./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/dijkstra-u_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:39:36,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:39:36,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:39:36,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:39:36,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:39:36,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:39:36,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:39:36,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:39:36,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:39:36,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:39:36,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:39:36,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:39:36,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:39:36,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:39:36,354 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:39:36,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:39:36,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:39:36,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:39:36,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:39:36,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:39:36,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:39:36,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:39:36,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:39:36,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:39:36,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:39:36,361 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:39:36,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:39:36,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:39:36,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:39:36,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:39:36,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:39:36,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:39:36,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:39:36,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:39:36,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:39:36,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:39:36,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:39:36,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:39:36,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:39:36,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:39:36,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:39:36,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:39:36,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:39:36,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:39:36,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2616f51a0d79e0bd682803708141b0dc94462ecdbaee78ea9cc6b43878e4310d [2024-10-11 20:39:36,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:39:36,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:39:36,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:39:36,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:39:36,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:39:36,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2024-10-11 20:39:38,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:39:38,260 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:39:38,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2024-10-11 20:39:38,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdd9fff4f/073dfc622f3a43428d088a7bc551a693/FLAG20ba9fdcc [2024-10-11 20:39:38,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdd9fff4f/073dfc622f3a43428d088a7bc551a693 [2024-10-11 20:39:38,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:39:38,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:39:38,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:39:38,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:39:38,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:39:38,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:38,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9dfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38, skipping insertion in model container [2024-10-11 20:39:38,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:38,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:39:38,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:39:38,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:39:38,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:39:38,975 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:39:38,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38 WrapperNode [2024-10-11 20:39:38,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:39:38,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:39:38,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:39:38,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:39:38,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:38,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,006 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-11 20:39:39,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:39:39,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:39:39,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:39:39,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:39:39,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,034 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-11 20:39:39,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:39:39,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:39:39,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:39:39,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:39:39,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (1/1) ... [2024-10-11 20:39:39,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:39:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:39,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:39:39,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:39:39,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:39:39,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:39:39,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:39:39,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:39:39,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:39:39,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:39:39,180 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:39:39,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:39:39,391 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 20:39:39,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:39:39,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:39:39,426 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:39:39,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:39 BoogieIcfgContainer [2024-10-11 20:39:39,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:39:39,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:39:39,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:39:39,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:39:39,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:39:38" (1/3) ... [2024-10-11 20:39:39,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e8119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:39:39, skipping insertion in model container [2024-10-11 20:39:39,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:39:38" (2/3) ... [2024-10-11 20:39:39,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e8119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:39:39, skipping insertion in model container [2024-10-11 20:39:39,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:39" (3/3) ... [2024-10-11 20:39:39,436 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2024-10-11 20:39:39,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:39:39,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:39:39,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:39:39,513 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;@71a6252a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:39:39,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:39:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:39:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:39:39,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:39,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:39:39,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-11 20:39:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706847777] [2024-10-11 20:39:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:39,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:39,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706847777] [2024-10-11 20:39:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706847777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:39:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100690276] [2024-10-11 20:39:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:39:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:39:39,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:39:39,688 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:39,722 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-11 20:39:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:39:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:39:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:39,730 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:39:39,730 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:39:39,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 20:39:39,736 INFO L432 NwaCegarLoop]: 43 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, 43 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-11 20:39:39,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:39:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 20:39:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-11 20:39:39,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-11 20:39:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:39,776 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-11 20:39:39,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-11 20:39:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:39:39,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:39,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:39:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:39:39,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:39,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-11 20:39:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016835759] [2024-10-11 20:39:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016835759] [2024-10-11 20:39:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016835759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:39:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428926142] [2024-10-11 20:39:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:39,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:39:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:39,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:39:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:39:39,911 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:39,983 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-11 20:39:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:39,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 20:39:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:39,985 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:39:39,985 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:39:39,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:39:39,987 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:39,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:39:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 20:39:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-11 20:39:39,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-11 20:39:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:39,995 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-11 20:39:39,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-11 20:39:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:39:39,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:39,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:39:39,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-11 20:39:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533342574] [2024-10-11 20:39:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533342574] [2024-10-11 20:39:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533342574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:40,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:39:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632088615] [2024-10-11 20:39:40,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:40,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:39:40,178 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:40,458 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-11 20:39:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:39:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:39:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:40,461 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:39:40,461 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:39:40,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:39:40,463 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:40,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:39:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:39:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-11 20:39:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-11 20:39:40,485 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-11 20:39:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:40,485 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-11 20:39:40,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-11 20:39:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:39:40,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:40,486 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:40,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:39:40,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:40,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-11 20:39:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804068192] [2024-10-11 20:39:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:40,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804068192] [2024-10-11 20:39:40,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804068192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:40,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717696136] [2024-10-11 20:39:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:40,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:40,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:39:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:40,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:39:40,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:40,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717696136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:39:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500755968] [2024-10-11 20:39:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:40,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:39:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:39:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:39:40,789 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:40,826 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-11 20:39:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:39:40,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 20:39:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:40,828 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:39:40,828 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:39:40,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:39:40,829 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:40,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:39:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-11 20:39:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-11 20:39:40,846 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-11 20:39:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:40,846 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-11 20:39:40,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-11 20:39:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:39:40,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:40,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:40,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:41,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:41,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-11 20:39:41,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362896561] [2024-10-11 20:39:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362896561] [2024-10-11 20:39:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362896561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:39:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:39:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004658322] [2024-10-11 20:39:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:39:41,178 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:41,255 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-11 20:39:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:39:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:39:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:41,257 INFO L225 Difference]: With dead ends: 57 [2024-10-11 20:39:41,257 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 20:39:41,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:39:41,258 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:41,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 20:39:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-11 20:39:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-11 20:39:41,273 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-11 20:39:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-11 20:39:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-11 20:39:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:39:41,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:41,277 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:41,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:39:41,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-11 20:39:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737882757] [2024-10-11 20:39:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737882757] [2024-10-11 20:39:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737882757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152567992] [2024-10-11 20:39:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:41,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:41,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:41,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:39:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:41,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:39:41,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152567992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:41,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 20:39:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767157531] [2024-10-11 20:39:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:39:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:39:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:39:41,465 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:41,520 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-11 20:39:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:41,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:39:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:41,522 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:39:41,522 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:39:41,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:39:41,523 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:41,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:39:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-11 20:39:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-11 20:39:41,532 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-11 20:39:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:41,532 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-11 20:39:41,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-11 20:39:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:39:41,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:41,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:41,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:39:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:41,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-11 20:39:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110178526] [2024-10-11 20:39:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110178526] [2024-10-11 20:39:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110178526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057062522] [2024-10-11 20:39:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:41,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:41,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:39:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:41,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:39:41,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057062522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:41,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-11 20:39:41,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73077917] [2024-10-11 20:39:41,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:39:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:41,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:39:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:39:41,953 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:42,068 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-10-11 20:39:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:39:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:39:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:42,072 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:39:42,072 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 20:39:42,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:39:42,073 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:42,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:39:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 20:39:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-11 20:39:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:39:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-11 20:39:42,086 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 14 [2024-10-11 20:39:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-11 20:39:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-11 20:39:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:39:42,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:42,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:42,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:42,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:42,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:42,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-11 20:39:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203801697] [2024-10-11 20:39:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:42,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:42,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203801697] [2024-10-11 20:39:42,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203801697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:42,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438436074] [2024-10-11 20:39:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:42,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:42,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:42,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:42,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:39:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:42,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:39:42,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:42,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:39:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438436074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:39:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:39:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-11 20:39:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643671628] [2024-10-11 20:39:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:39:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:39:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:39:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:39:42,537 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:42,619 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-11 20:39:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:39:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:39:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:42,622 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:39:42,623 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 20:39:42,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:39:42,625 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:42,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:39:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 20:39:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-11 20:39:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:39:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-11 20:39:42,638 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2024-10-11 20:39:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:42,638 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-11 20:39:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-11 20:39:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:39:42,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:42,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:39:42,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:42,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:39:42,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:42,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-11 20:39:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309547060] [2024-10-11 20:39:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:42,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309547060] [2024-10-11 20:39:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309547060] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755122114] [2024-10-11 20:39:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:42,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:42,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:39:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:42,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:39:42,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:43,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:39:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755122114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:43,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-11 20:39:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869263347] [2024-10-11 20:39:43,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:39:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:39:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:39:43,120 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:45,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:49,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:53,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:39:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:53,542 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-10-11 20:39:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 20:39:53,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:39:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:53,544 INFO L225 Difference]: With dead ends: 86 [2024-10-11 20:39:53,544 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 20:39:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:39:53,545 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:53,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 238 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2024-10-11 20:39:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 20:39:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-10-11 20:39:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 20:39:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-11 20:39:53,562 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 16 [2024-10-11 20:39:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:53,563 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-11 20:39:53,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:39:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-11 20:39:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:39:53,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:53,569 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:39:53,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:53,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:53,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1351280755, now seen corresponding path program 1 times [2024-10-11 20:39:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155514746] [2024-10-11 20:39:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 20:39:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:39:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:39:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:39:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:39:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:39:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 20:39:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:39:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:39:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:39:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 20:39:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:39:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:39:54,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155514746] [2024-10-11 20:39:54,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155514746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:54,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137482316] [2024-10-11 20:39:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:54,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:54,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:54,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:39:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:54,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:39:54,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 20:39:54,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:39:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:39:55,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137482316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:39:55,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:39:55,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-10-11 20:39:55,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155683801] [2024-10-11 20:39:55,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:39:55,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 20:39:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:39:55,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 20:39:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:39:55,530 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 20:39:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:39:57,375 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2024-10-11 20:39:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 20:39:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 93 [2024-10-11 20:39:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:39:57,379 INFO L225 Difference]: With dead ends: 236 [2024-10-11 20:39:57,379 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 20:39:57,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1016, Invalid=3144, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 20:39:57,383 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 264 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:39:57,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 299 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 20:39:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 20:39:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2024-10-11 20:39:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 20:39:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 234 transitions. [2024-10-11 20:39:57,428 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 234 transitions. Word has length 93 [2024-10-11 20:39:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:39:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 234 transitions. [2024-10-11 20:39:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-11 20:39:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 234 transitions. [2024-10-11 20:39:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 20:39:57,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:39:57,437 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-11 20:39:57,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:39:57,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:39:57,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:39:57,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:39:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash 958093722, now seen corresponding path program 2 times [2024-10-11 20:39:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:39:57,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310304296] [2024-10-11 20:39:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:39:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:39:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:39:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:39:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:39:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:39:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:39:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:39:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 20:39:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:39:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:39:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 20:39:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 20:39:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:39:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:39:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:39:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:39:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 20:39:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:39:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:39:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 20:39:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 20:39:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 20:39:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 20:39:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 20:39:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:39:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 20:39:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 20:39:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 20:39:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:39:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 20:39:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:39:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:39:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 20:39:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-11 20:39:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-11 20:39:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-11 20:39:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:39:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:39:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:39:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:39:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310304296] [2024-10-11 20:39:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310304296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:39:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383473209] [2024-10-11 20:39:59,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:39:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:39:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:39:59,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:39:59,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:39:59,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:39:59,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:39:59,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 20:39:59,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:39:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 2388 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-11 20:39:59,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:40:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383473209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:01,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-10-11 20:40:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570085192] [2024-10-11 20:40:01,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:01,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 20:40:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 20:40:01,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 20:40:01,144 INFO L87 Difference]: Start difference. First operand 175 states and 234 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-11 20:40:06,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:40:09,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:40:13,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 20:40:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:13,558 INFO L93 Difference]: Finished difference Result 592 states and 805 transitions. [2024-10-11 20:40:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-11 20:40:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 242 [2024-10-11 20:40:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:13,569 INFO L225 Difference]: With dead ends: 592 [2024-10-11 20:40:13,569 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 20:40:13,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2197, Invalid=7309, Unknown=0, NotChecked=0, Total=9506 [2024-10-11 20:40:13,574 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 440 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:13,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 287 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 414 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-10-11 20:40:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 20:40:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 276. [2024-10-11 20:40:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 20:40:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 374 transitions. [2024-10-11 20:40:13,623 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 374 transitions. Word has length 242 [2024-10-11 20:40:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:13,625 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 374 transitions. [2024-10-11 20:40:13,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-11 20:40:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 374 transitions. [2024-10-11 20:40:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-11 20:40:13,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:13,630 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-11 20:40:13,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:13,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:13,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:13,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1972813965, now seen corresponding path program 1 times [2024-10-11 20:40:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445528325] [2024-10-11 20:40:13,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:40:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 20:40:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 20:40:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:40:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:40:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:40:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:40:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:40:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:40:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 20:40:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:40:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 20:40:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:40:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 20:40:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 20:40:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 20:40:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 20:40:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 20:40:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 20:40:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 20:40:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 20:40:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 20:40:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 20:40:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 20:40:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 20:40:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 20:40:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 20:40:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 20:40:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 20:40:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-11 20:40:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-11 20:40:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-11 20:40:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 20:40:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 20:40:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 20:40:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 20:40:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:40:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445528325] [2024-10-11 20:40:14,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445528325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:14,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938765909] [2024-10-11 20:40:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:14,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:14,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:40:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:15,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 20:40:15,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:40:15,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-11 20:40:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938765909] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:15,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 41 [2024-10-11 20:40:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470689924] [2024-10-11 20:40:15,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 20:40:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:15,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 20:40:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 20:40:15,963 INFO L87 Difference]: Start difference. First operand 276 states and 374 transitions. Second operand has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:40:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:17,019 INFO L93 Difference]: Finished difference Result 489 states and 648 transitions. [2024-10-11 20:40:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 20:40:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 266 [2024-10-11 20:40:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:17,023 INFO L225 Difference]: With dead ends: 489 [2024-10-11 20:40:17,024 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 20:40:17,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1752, Invalid=3798, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 20:40:17,029 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 352 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:17,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 181 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:40:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 20:40:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 325. [2024-10-11 20:40:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 226 states have (on average 1.1504424778761062) internal successors, (260), 226 states have internal predecessors, (260), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-11 20:40:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 428 transitions. [2024-10-11 20:40:17,057 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 428 transitions. Word has length 266 [2024-10-11 20:40:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:17,057 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 428 transitions. [2024-10-11 20:40:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 41 states have internal predecessors, (114), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:40:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 428 transitions. [2024-10-11 20:40:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-11 20:40:17,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:17,062 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-11 20:40:17,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:40:17,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:40:17,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 279119509, now seen corresponding path program 3 times [2024-10-11 20:40:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835234729] [2024-10-11 20:40:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:40:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:40:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:40:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:40:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 20:40:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:40:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 20:40:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:40:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 20:40:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:40:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:40:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 20:40:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:40:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 20:40:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:40:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 20:40:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 20:40:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:40:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:40:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 20:40:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 20:40:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 20:40:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 20:40:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 20:40:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:40:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 20:40:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 20:40:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-11 20:40:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 20:40:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 20:40:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 20:40:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 20:40:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 20:40:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 20:40:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:40:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 20:40:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 20:40:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835234729] [2024-10-11 20:40:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835234729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793329926] [2024-10-11 20:40:18,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:40:18,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:18,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:18,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:18,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:40:19,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:40:19,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:19,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:19,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2024-10-11 20:40:19,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793329926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [34] total 37 [2024-10-11 20:40:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554504796] [2024-10-11 20:40:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:19,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1108, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 20:40:19,259 INFO L87 Difference]: Start difference. First operand 325 states and 428 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 20:40:23,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 20:40:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:23,435 INFO L93 Difference]: Finished difference Result 333 states and 436 transitions. [2024-10-11 20:40:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:40:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 267 [2024-10-11 20:40:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:23,437 INFO L225 Difference]: With dead ends: 333 [2024-10-11 20:40:23,437 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:40:23,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 20:40:23,439 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:23,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 20:40:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:40:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:40:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:40:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:40:23,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-11 20:40:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:40:23,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 20:40:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:40:23,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:40:23,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:40:23,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:40:23,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:40:23,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:40:23,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:23,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:23,652 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:23,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:40:25,104 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:40:25,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:40:25 BoogieIcfgContainer [2024-10-11 20:40:25,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:40:25,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:40:25,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:40:25,123 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:40:25,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:39:39" (3/4) ... [2024-10-11 20:40:25,125 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:40:25,129 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:40:25,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 20:40:25,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 20:40:25,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:40:25,133 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:40:25,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:40:25,232 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:40:25,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:40:25,233 INFO L158 Benchmark]: Toolchain (without parser) took 46569.86ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 92.5MB in the beginning and 146.0MB in the end (delta: -53.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,233 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:40:25,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.97ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 119.8MB in the end (delta: -27.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.54ms. Allocated memory is still 153.1MB. Free memory was 119.8MB in the beginning and 118.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,234 INFO L158 Benchmark]: Boogie Preprocessor took 43.02ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,234 INFO L158 Benchmark]: RCFGBuilder took 376.34ms. Allocated memory is still 153.1MB. Free memory was 116.3MB in the beginning and 100.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,234 INFO L158 Benchmark]: TraceAbstraction took 45692.75ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 99.5MB in the beginning and 150.2MB in the end (delta: -50.7MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,234 INFO L158 Benchmark]: Witness Printer took 109.62ms. Allocated memory is still 222.3MB. Free memory was 150.2MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:40:25,240 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.18ms. Allocated memory is still 100.7MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.97ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 119.8MB in the end (delta: -27.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.54ms. Allocated memory is still 153.1MB. Free memory was 119.8MB in the beginning and 118.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.02ms. Allocated memory is still 153.1MB. Free memory was 118.4MB in the beginning and 116.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.34ms. Allocated memory is still 153.1MB. Free memory was 116.3MB in the beginning and 100.3MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45692.75ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 99.5MB in the beginning and 150.2MB in the end (delta: -50.7MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. * Witness Printer took 109.62ms. Allocated memory is still 222.3MB. Free memory was 150.2MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1311 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1311 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1497 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1389 IncrementalHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 357 mSDtfsCounter, 1389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2068 GetRequests, 1701 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5549 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=12, InterpolantAutomatonStates: 255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 479 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4683 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 19649/23648 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 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((0 <= ((long long) counter + 2147483647)) && (counter <= 50)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483641) && (0 <= ((long long) counter + 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:40:25,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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