./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/hard2_valuebound2.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/hard2_valuebound2.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 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:57:19,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:57:19,265 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:57:19,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:57:19,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:57:19,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:57:19,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:57:19,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:57:19,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:57:19,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:57:19,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:57:19,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:57:19,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:57:19,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:57:19,288 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:57:19,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:57:19,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:57:19,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:57:19,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:57:19,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:57:19,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:57:19,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:57:19,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:57:19,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:57:19,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:57:19,290 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:57:19,291 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:57:19,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:57:19,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:57:19,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:57:19,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:57:19,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:57:19,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:57:19,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:57:19,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:57:19,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:57:19,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:57:19,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:57:19,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:57:19,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:57:19,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:57:19,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:57:19,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:57:19,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:57:19,297 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 -> 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 [2024-10-11 20:57:19,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:57:19,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:57:19,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:57:19,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:57:19,516 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:57:19,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-10-11 20:57:20,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:57:20,953 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:57:20,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2024-10-11 20:57:20,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12dba8292/aa61e853b9484cdf850832ceeb7a28f1/FLAG787e323f2 [2024-10-11 20:57:21,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/12dba8292/aa61e853b9484cdf850832ceeb7a28f1 [2024-10-11 20:57:21,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:57:21,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:57:21,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:57:21,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:57:21,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:57:21,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc070a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21, skipping insertion in model container [2024-10-11 20:57:21,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:57:21,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:57:21,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:57:21,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:57:21,649 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:57:21,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21 WrapperNode [2024-10-11 20:57:21,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:57:21,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:57:21,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:57:21,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:57:21,656 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:57:21" (1/1) ... [2024-10-11 20:57:21,662 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:57:21" (1/1) ... [2024-10-11 20:57:21,680 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2024-10-11 20:57:21,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:57:21,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:57:21,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:57:21,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:57:21,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,705 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 20:57:21,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:57:21,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:57:21,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:57:21,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:57:21,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (1/1) ... [2024-10-11 20:57:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:57:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:21,756 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:57:21,760 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:57:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:57:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:57:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:57:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:57:21,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:57:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:57:21,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:57:21,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:57:21,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:57:22,135 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 20:57:22,136 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:57:22,161 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:57:22,162 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:57:22,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:57:22 BoogieIcfgContainer [2024-10-11 20:57:22,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:57:22,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:57:22,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:57:22,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:57:22,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:57:21" (1/3) ... [2024-10-11 20:57:22,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a059cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:57:22, skipping insertion in model container [2024-10-11 20:57:22,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:57:21" (2/3) ... [2024-10-11 20:57:22,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a059cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:57:22, skipping insertion in model container [2024-10-11 20:57:22,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:57:22" (3/3) ... [2024-10-11 20:57:22,171 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2024-10-11 20:57:22,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:57:22,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-11 20:57:22,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:57:22,249 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;@681c0bd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:57:22,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-11 20:57:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 60 states have internal predecessors, (69), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:57:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:57:22,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:22,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:57:22,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:22,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 491003590, now seen corresponding path program 1 times [2024-10-11 20:57:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420641768] [2024-10-11 20:57:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:22,401 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:57:22,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420641768] [2024-10-11 20:57:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420641768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:22,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:57:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123017414] [2024-10-11 20:57:22,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:22,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:57:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:57:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:57:22,428 INFO L87 Difference]: Start difference. First operand has 69 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 60 states have internal predecessors, (69), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:57:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:22,454 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2024-10-11 20:57:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:57:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-11 20:57:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:22,462 INFO L225 Difference]: With dead ends: 136 [2024-10-11 20:57:22,462 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 20:57:22,465 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:57:22,467 INFO L432 NwaCegarLoop]: 75 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, 75 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:57:22,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 20:57:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 20:57:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 58 states have internal predecessors, (61), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:57:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-10-11 20:57:22,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 6 [2024-10-11 20:57:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:22,503 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-10-11 20:57:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:57:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-10-11 20:57:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:57:22,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:22,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:57:22,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1989668520, now seen corresponding path program 1 times [2024-10-11 20:57:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817522938] [2024-10-11 20:57:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676015499] [2024-10-11 20:57:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:22,548 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:57:22,550 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:57:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:22,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:22,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:57:22,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817522938] [2024-10-11 20:57:22,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676015499] [2024-10-11 20:57:22,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676015499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:22,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:22,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:57:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119783445] [2024-10-11 20:57:22,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:57:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:22,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:57:22,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:22,685 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:57:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:22,763 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2024-10-11 20:57:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:57:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-10-11 20:57:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:22,765 INFO L225 Difference]: With dead ends: 137 [2024-10-11 20:57:22,766 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 20:57:22,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:22,767 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:22,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 94 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 20:57:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-11 20:57:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 74 states have internal predecessors, (84), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:57:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-10-11 20:57:22,788 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 15 [2024-10-11 20:57:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:22,789 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-10-11 20:57:22,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:57:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-10-11 20:57:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:57:22,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:22,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:22,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:57:22,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:22,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:22,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1953746883, now seen corresponding path program 1 times [2024-10-11 20:57:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051486896] [2024-10-11 20:57:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:57:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051486896] [2024-10-11 20:57:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051486896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:23,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:23,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:57:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585855755] [2024-10-11 20:57:23,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:23,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:57:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:57:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:23,167 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:23,226 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-10-11 20:57:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:57:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-11 20:57:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:23,228 INFO L225 Difference]: With dead ends: 96 [2024-10-11 20:57:23,228 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 20:57:23,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:23,229 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:23,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 105 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 20:57:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-10-11 20:57:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.607843137254902) internal successors, (82), 74 states have internal predecessors, (82), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 20:57:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-10-11 20:57:23,237 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 23 [2024-10-11 20:57:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:23,238 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-10-11 20:57:23,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-10-11 20:57:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:57:23,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:23,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:57:23,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash -436612543, now seen corresponding path program 1 times [2024-10-11 20:57:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064024968] [2024-10-11 20:57:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334688323] [2024-10-11 20:57:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:23,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:23,273 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:57:23,279 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:57:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:57:23,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:57:23,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064024968] [2024-10-11 20:57:23,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:23,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334688323] [2024-10-11 20:57:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334688323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:57:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477037321] [2024-10-11 20:57:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:57:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:57:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:23,346 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:23,416 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2024-10-11 20:57:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:57:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 20:57:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:23,419 INFO L225 Difference]: With dead ends: 121 [2024-10-11 20:57:23,419 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 20:57:23,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:23,420 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:23,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 20:57:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2024-10-11 20:57:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 89 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:57:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2024-10-11 20:57:23,432 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 24 [2024-10-11 20:57:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:23,432 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2024-10-11 20:57:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2024-10-11 20:57:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:57:23,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:23,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:23,446 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:57:23,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:23,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:23,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1322143843, now seen corresponding path program 1 times [2024-10-11 20:57:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259069363] [2024-10-11 20:57:23,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:23,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:57:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259069363] [2024-10-11 20:57:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259069363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:57:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101267678] [2024-10-11 20:57:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:23,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:57:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:57:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:23,817 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:57:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:24,239 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2024-10-11 20:57:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:57:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 20:57:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:24,240 INFO L225 Difference]: With dead ends: 119 [2024-10-11 20:57:24,240 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:57:24,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:57:24,241 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 299 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:24,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 85 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:57:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:57:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2024-10-11 20:57:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 93 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:57:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2024-10-11 20:57:24,252 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 26 [2024-10-11 20:57:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:24,253 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2024-10-11 20:57:24,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:57:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2024-10-11 20:57:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:57:24,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:24,253 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:57:24,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:24,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1963213740, now seen corresponding path program 1 times [2024-10-11 20:57:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513759516] [2024-10-11 20:57:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:57:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513759516] [2024-10-11 20:57:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513759516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:57:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986765714] [2024-10-11 20:57:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:24,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:57:24,337 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:24,588 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-10-11 20:57:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:57:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-11 20:57:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:24,589 INFO L225 Difference]: With dead ends: 119 [2024-10-11 20:57:24,589 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:57:24,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:24,590 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:24,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 154 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:57:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2024-10-11 20:57:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5) internal successors, (114), 99 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:57:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2024-10-11 20:57:24,600 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 27 [2024-10-11 20:57:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:24,600 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2024-10-11 20:57:24,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2024-10-11 20:57:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:57:24,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:24,601 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:24,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:57:24,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:24,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:24,601 INFO L85 PathProgramCache]: Analyzing trace with hash -931997051, now seen corresponding path program 1 times [2024-10-11 20:57:24,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:24,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608769384] [2024-10-11 20:57:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427309885] [2024-10-11 20:57:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:24,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:24,612 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:57:24,613 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:57:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:24,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:24,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:57:24,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608769384] [2024-10-11 20:57:24,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427309885] [2024-10-11 20:57:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427309885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:24,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:24,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:57:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103181545] [2024-10-11 20:57:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:57:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:57:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:57:24,757 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:24,843 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2024-10-11 20:57:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:57:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-11 20:57:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:24,844 INFO L225 Difference]: With dead ends: 124 [2024-10-11 20:57:24,844 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:57:24,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:57:24,845 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:24,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 89 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:57:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:57:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 98 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:57:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2024-10-11 20:57:24,854 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 38 [2024-10-11 20:57:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:24,855 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2024-10-11 20:57:24,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2024-10-11 20:57:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:57:24,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:24,856 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:24,869 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:57:25,059 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:57:25,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:25,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1172862545, now seen corresponding path program 1 times [2024-10-11 20:57:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714441086] [2024-10-11 20:57:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1025672990] [2024-10-11 20:57:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:25,072 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:57:25,079 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:57:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:25,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:57:25,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714441086] [2024-10-11 20:57:25,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025672990] [2024-10-11 20:57:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025672990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:25,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2024-10-11 20:57:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121715111] [2024-10-11 20:57:25,494 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:57:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:57:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:57:25,495 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:25,611 INFO L93 Difference]: Finished difference Result 190 states and 245 transitions. [2024-10-11 20:57:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:57:25,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-11 20:57:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:25,613 INFO L225 Difference]: With dead ends: 190 [2024-10-11 20:57:25,613 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 20:57:25,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:57:25,614 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 43 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:25,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 121 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 20:57:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2024-10-11 20:57:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 149 states have internal predecessors, (185), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:57:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2024-10-11 20:57:25,643 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 39 [2024-10-11 20:57:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:25,643 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2024-10-11 20:57:25,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2024-10-11 20:57:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:57:25,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:25,646 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:25,663 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:57:25,850 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:57:25,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:25,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:25,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1723238283, now seen corresponding path program 1 times [2024-10-11 20:57:25,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:25,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408777064] [2024-10-11 20:57:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:25,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:57:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:57:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408777064] [2024-10-11 20:57:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408777064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:57:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16089641] [2024-10-11 20:57:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:25,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:57:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:57:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:25,996 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:26,258 INFO L93 Difference]: Finished difference Result 186 states and 243 transitions. [2024-10-11 20:57:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:57:26,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-10-11 20:57:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:26,260 INFO L225 Difference]: With dead ends: 186 [2024-10-11 20:57:26,260 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 20:57:26,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:57:26,260 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 195 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:26,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 113 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 20:57:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2024-10-11 20:57:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 131 states have (on average 1.4198473282442747) internal successors, (186), 150 states have internal predecessors, (186), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:57:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2024-10-11 20:57:26,273 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 43 [2024-10-11 20:57:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:26,273 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2024-10-11 20:57:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2024-10-11 20:57:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:57:26,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:26,274 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:57:26,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:26,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1880779090, now seen corresponding path program 1 times [2024-10-11 20:57:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263697093] [2024-10-11 20:57:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 20:57:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 20:57:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:26,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263697093] [2024-10-11 20:57:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263697093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:26,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:26,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:57:26,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831253976] [2024-10-11 20:57:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:26,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:26,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:26,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:57:26,379 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:26,498 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2024-10-11 20:57:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-10-11 20:57:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:26,502 INFO L225 Difference]: With dead ends: 180 [2024-10-11 20:57:26,502 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 20:57:26,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:57:26,503 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:26,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 20:57:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-11 20:57:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 142 states have internal predecessors, (177), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 20:57:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2024-10-11 20:57:26,518 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 44 [2024-10-11 20:57:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2024-10-11 20:57:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:57:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2024-10-11 20:57:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:57:26,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:26,521 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:26,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:57:26,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:26,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:26,523 INFO L85 PathProgramCache]: Analyzing trace with hash 878702362, now seen corresponding path program 1 times [2024-10-11 20:57:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090130550] [2024-10-11 20:57:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:57:26,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:26,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090130550] [2024-10-11 20:57:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090130550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150459988] [2024-10-11 20:57:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:26,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:26,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:26,597 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:57:26,598 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:57:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:26,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:26,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:57:26,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150459988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:26,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 20:57:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320985782] [2024-10-11 20:57:26,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:57:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:57:26,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:57:26,685 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:57:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:26,756 INFO L93 Difference]: Finished difference Result 249 states and 340 transitions. [2024-10-11 20:57:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:57:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-10-11 20:57:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:26,757 INFO L225 Difference]: With dead ends: 249 [2024-10-11 20:57:26,757 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 20:57:26,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:57:26,758 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:26,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 112 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 20:57:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 226. [2024-10-11 20:57:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 177 states have (on average 1.4463276836158192) internal successors, (256), 195 states have internal predecessors, (256), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:57:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2024-10-11 20:57:26,774 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 46 [2024-10-11 20:57:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2024-10-11 20:57:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:57:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2024-10-11 20:57:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 20:57:26,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:26,776 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:26,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:57:26,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:57:26,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:26,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1469969510, now seen corresponding path program 1 times [2024-10-11 20:57:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064281152] [2024-10-11 20:57:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:57:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064281152] [2024-10-11 20:57:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064281152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984579241] [2024-10-11 20:57:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:27,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:27,045 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:57:27,046 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:57:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:27,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:57:27,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:57:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984579241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:27,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 20:57:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100978381] [2024-10-11 20:57:27,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:57:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:57:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:27,183 INFO L87 Difference]: Start difference. First operand 226 states and 314 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:27,324 INFO L93 Difference]: Finished difference Result 374 states and 513 transitions. [2024-10-11 20:57:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:57:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 47 [2024-10-11 20:57:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:27,327 INFO L225 Difference]: With dead ends: 374 [2024-10-11 20:57:27,327 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 20:57:27,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:27,328 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 133 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:27,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 191 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 20:57:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 326. [2024-10-11 20:57:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.4444444444444444) internal successors, (377), 279 states have internal predecessors, (377), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 467 transitions. [2024-10-11 20:57:27,344 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 467 transitions. Word has length 47 [2024-10-11 20:57:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 467 transitions. [2024-10-11 20:57:27,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 467 transitions. [2024-10-11 20:57:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 20:57:27,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:27,345 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:27,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:57:27,545 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,SelfDestructingSolverStorable11 [2024-10-11 20:57:27,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash 334152881, now seen corresponding path program 1 times [2024-10-11 20:57:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309026411] [2024-10-11 20:57:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930263396] [2024-10-11 20:57:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:27,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:27,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:27,557 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:57:27,558 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:57:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:27,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:27,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 20:57:27,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309026411] [2024-10-11 20:57:27,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930263396] [2024-10-11 20:57:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930263396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:27,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:57:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597181190] [2024-10-11 20:57:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:57:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:57:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:57:27,683 INFO L87 Difference]: Start difference. First operand 326 states and 467 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:27,754 INFO L93 Difference]: Finished difference Result 345 states and 492 transitions. [2024-10-11 20:57:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:57:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-10-11 20:57:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:27,756 INFO L225 Difference]: With dead ends: 345 [2024-10-11 20:57:27,756 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 20:57:27,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:57:27,757 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:27,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 20:57:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 323. [2024-10-11 20:57:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 276 states have internal predecessors, (365), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 455 transitions. [2024-10-11 20:57:27,775 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 455 transitions. Word has length 50 [2024-10-11 20:57:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:27,776 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 455 transitions. [2024-10-11 20:57:27,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 20:57:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 455 transitions. [2024-10-11 20:57:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 20:57:27,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:27,777 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 20:57:27,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:57:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:27,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1641751762, now seen corresponding path program 2 times [2024-10-11 20:57:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527038527] [2024-10-11 20:57:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724124544] [2024-10-11 20:57:27,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:57:27,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:27,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:27,989 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:57:27,990 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:57:28,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:57:28,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:28,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:57:28,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:28,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527038527] [2024-10-11 20:57:28,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:28,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724124544] [2024-10-11 20:57:28,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724124544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:28,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:28,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:57:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395120322] [2024-10-11 20:57:28,320 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:28,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:28,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:28,320 INFO L87 Difference]: Start difference. First operand 323 states and 455 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 20:57:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:28,472 INFO L93 Difference]: Finished difference Result 418 states and 586 transitions. [2024-10-11 20:57:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:28,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-10-11 20:57:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:28,474 INFO L225 Difference]: With dead ends: 418 [2024-10-11 20:57:28,474 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 20:57:28,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:28,475 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 86 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:28,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 112 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 20:57:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 323. [2024-10-11 20:57:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.4069767441860466) internal successors, (363), 276 states have internal predecessors, (363), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 453 transitions. [2024-10-11 20:57:28,491 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 453 transitions. Word has length 62 [2024-10-11 20:57:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:28,492 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 453 transitions. [2024-10-11 20:57:28,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 20:57:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2024-10-11 20:57:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:57:28,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:28,493 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:28,506 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:57:28,696 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,SelfDestructingSolverStorable13 [2024-10-11 20:57:28,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 968937877, now seen corresponding path program 1 times [2024-10-11 20:57:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016575393] [2024-10-11 20:57:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016575393] [2024-10-11 20:57:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016575393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:28,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:28,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:57:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100885922] [2024-10-11 20:57:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:28,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:57:28,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:57:28,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:28,773 INFO L87 Difference]: Start difference. First operand 323 states and 453 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:28,818 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2024-10-11 20:57:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:57:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-11 20:57:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:28,820 INFO L225 Difference]: With dead ends: 323 [2024-10-11 20:57:28,820 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 20:57:28,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:57:28,821 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:28,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 20:57:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-11 20:57:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.3837209302325582) internal successors, (357), 275 states have internal predecessors, (357), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 447 transitions. [2024-10-11 20:57:28,836 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 447 transitions. Word has length 69 [2024-10-11 20:57:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:28,836 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 447 transitions. [2024-10-11 20:57:28,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 447 transitions. [2024-10-11 20:57:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 20:57:28,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:28,837 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:28,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:57:28,837 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:28,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash -27696772, now seen corresponding path program 1 times [2024-10-11 20:57:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892638063] [2024-10-11 20:57:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892638063] [2024-10-11 20:57:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892638063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093060475] [2024-10-11 20:57:28,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:29,004 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:57:29,005 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:57:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:57:29,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:29,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093060475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:29,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:29,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:57:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571191948] [2024-10-11 20:57:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:57:29,173 INFO L87 Difference]: Start difference. First operand 322 states and 447 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:57:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:29,264 INFO L93 Difference]: Finished difference Result 340 states and 462 transitions. [2024-10-11 20:57:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:29,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2024-10-11 20:57:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:29,266 INFO L225 Difference]: With dead ends: 340 [2024-10-11 20:57:29,266 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 20:57:29,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:57:29,267 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 124 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:29,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 123 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 20:57:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 322. [2024-10-11 20:57:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.372093023255814) internal successors, (354), 275 states have internal predecessors, (354), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 444 transitions. [2024-10-11 20:57:29,281 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 444 transitions. Word has length 70 [2024-10-11 20:57:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 444 transitions. [2024-10-11 20:57:29,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:57:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 444 transitions. [2024-10-11 20:57:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 20:57:29,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:29,282 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:29,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:57:29,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:29,486 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:29,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash -858599817, now seen corresponding path program 1 times [2024-10-11 20:57:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879349504] [2024-10-11 20:57:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879349504] [2024-10-11 20:57:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879349504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738196939] [2024-10-11 20:57:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:29,609 INFO L229 MonitoredProcess]: Starting monitored process 11 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:57:29,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:57:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:29,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:29,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:29,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738196939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:29,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-11 20:57:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63297107] [2024-10-11 20:57:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:29,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:29,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:29,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:57:29,814 INFO L87 Difference]: Start difference. First operand 322 states and 444 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:29,959 INFO L93 Difference]: Finished difference Result 341 states and 465 transitions. [2024-10-11 20:57:29,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:29,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 71 [2024-10-11 20:57:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:29,961 INFO L225 Difference]: With dead ends: 341 [2024-10-11 20:57:29,962 INFO L226 Difference]: Without dead ends: 340 [2024-10-11 20:57:29,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:57:29,962 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:29,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 117 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-11 20:57:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 331. [2024-10-11 20:57:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 267 states have (on average 1.3595505617977528) internal successors, (363), 284 states have internal predecessors, (363), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 453 transitions. [2024-10-11 20:57:29,983 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 453 transitions. Word has length 71 [2024-10-11 20:57:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:29,983 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 453 transitions. [2024-10-11 20:57:29,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 453 transitions. [2024-10-11 20:57:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 20:57:29,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:29,984 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:29,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 20:57:30,185 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:30,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -846790434, now seen corresponding path program 1 times [2024-10-11 20:57:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091811716] [2024-10-11 20:57:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:30,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091811716] [2024-10-11 20:57:30,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091811716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311733617] [2024-10-11 20:57:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:30,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:30,292 INFO L229 MonitoredProcess]: Starting monitored process 12 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:57:30,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:57:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:57:30,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:30,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311733617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:30,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 20:57:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687115805] [2024-10-11 20:57:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:30,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:57:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:57:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:30,438 INFO L87 Difference]: Start difference. First operand 331 states and 453 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:30,576 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2024-10-11 20:57:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:57:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2024-10-11 20:57:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:30,578 INFO L225 Difference]: With dead ends: 340 [2024-10-11 20:57:30,578 INFO L226 Difference]: Without dead ends: 338 [2024-10-11 20:57:30,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:30,579 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:30,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-11 20:57:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2024-10-11 20:57:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 287 states have internal predecessors, (359), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 20:57:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 449 transitions. [2024-10-11 20:57:30,598 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 449 transitions. Word has length 72 [2024-10-11 20:57:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 449 transitions. [2024-10-11 20:57:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 449 transitions. [2024-10-11 20:57:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 20:57:30,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:30,599 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:30,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:57:30,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:30,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2016785600, now seen corresponding path program 1 times [2024-10-11 20:57:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043641235] [2024-10-11 20:57:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455998896] [2024-10-11 20:57:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:30,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:30,822 INFO L229 MonitoredProcess]: Starting monitored process 13 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:57:30,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 20:57:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:30,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:57:30,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:31,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:31,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043641235] [2024-10-11 20:57:31,584 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455998896] [2024-10-11 20:57:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455998896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:31,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2024-10-11 20:57:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025372875] [2024-10-11 20:57:31,585 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:57:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:57:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:57:31,585 INFO L87 Difference]: Start difference. First operand 334 states and 449 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:31,741 INFO L93 Difference]: Finished difference Result 418 states and 575 transitions. [2024-10-11 20:57:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:57:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 74 [2024-10-11 20:57:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:31,744 INFO L225 Difference]: With dead ends: 418 [2024-10-11 20:57:31,744 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 20:57:31,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:57:31,745 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:31,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 87 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 20:57:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 394. [2024-10-11 20:57:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 324 states have (on average 1.345679012345679) internal successors, (436), 341 states have internal predecessors, (436), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:57:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 538 transitions. [2024-10-11 20:57:31,773 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 538 transitions. Word has length 74 [2024-10-11 20:57:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:31,773 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 538 transitions. [2024-10-11 20:57:31,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 538 transitions. [2024-10-11 20:57:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:57:31,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:31,774 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:31,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:31,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:31,974 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1904155923, now seen corresponding path program 1 times [2024-10-11 20:57:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198204303] [2024-10-11 20:57:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119811024] [2024-10-11 20:57:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:31,986 INFO L229 MonitoredProcess]: Starting monitored process 14 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:57:31,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 20:57:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:32,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:57:32,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:32,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198204303] [2024-10-11 20:57:33,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119811024] [2024-10-11 20:57:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119811024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:33,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-10-11 20:57:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406153247] [2024-10-11 20:57:33,173 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:33,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:57:33,174 INFO L87 Difference]: Start difference. First operand 394 states and 538 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:33,284 INFO L93 Difference]: Finished difference Result 398 states and 538 transitions. [2024-10-11 20:57:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 75 [2024-10-11 20:57:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:33,286 INFO L225 Difference]: With dead ends: 398 [2024-10-11 20:57:33,286 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 20:57:33,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:57:33,286 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:33,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 86 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 20:57:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2024-10-11 20:57:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 324 states have (on average 1.2746913580246915) internal successors, (413), 339 states have internal predecessors, (413), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:57:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 515 transitions. [2024-10-11 20:57:33,307 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 515 transitions. Word has length 75 [2024-10-11 20:57:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:33,307 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 515 transitions. [2024-10-11 20:57:33,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 515 transitions. [2024-10-11 20:57:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 20:57:33,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:33,308 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:33,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:33,508 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:33,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1100708446, now seen corresponding path program 1 times [2024-10-11 20:57:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:33,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735776284] [2024-10-11 20:57:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 20:57:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735776284] [2024-10-11 20:57:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735776284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:57:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091332568] [2024-10-11 20:57:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:57:33,589 INFO L87 Difference]: Start difference. First operand 392 states and 515 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:33,914 INFO L93 Difference]: Finished difference Result 394 states and 515 transitions. [2024-10-11 20:57:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:57:33,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2024-10-11 20:57:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:33,916 INFO L225 Difference]: With dead ends: 394 [2024-10-11 20:57:33,916 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 20:57:33,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:57:33,917 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:33,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 147 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 20:57:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2024-10-11 20:57:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 324 states have (on average 1.2469135802469136) internal successors, (404), 338 states have internal predecessors, (404), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:57:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 506 transitions. [2024-10-11 20:57:33,943 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 506 transitions. Word has length 76 [2024-10-11 20:57:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:33,944 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 506 transitions. [2024-10-11 20:57:33,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 506 transitions. [2024-10-11 20:57:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 20:57:33,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:33,944 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:33,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:57:33,945 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 237776629, now seen corresponding path program 1 times [2024-10-11 20:57:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191989203] [2024-10-11 20:57:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191989203] [2024-10-11 20:57:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191989203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024639663] [2024-10-11 20:57:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:34,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:34,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:34,088 INFO L229 MonitoredProcess]: Starting monitored process 15 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:57:34,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 20:57:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:34,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 20:57:34,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 20:57:34,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024639663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:35,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:57:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 20:57:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122295503] [2024-10-11 20:57:35,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:35,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:57:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:57:35,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:57:35,012 INFO L87 Difference]: Start difference. First operand 391 states and 506 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 20:57:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:36,329 INFO L93 Difference]: Finished difference Result 685 states and 910 transitions. [2024-10-11 20:57:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 20:57:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 77 [2024-10-11 20:57:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:36,334 INFO L225 Difference]: With dead ends: 685 [2024-10-11 20:57:36,334 INFO L226 Difference]: Without dead ends: 680 [2024-10-11 20:57:36,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 20:57:36,335 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 347 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:36,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 323 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:57:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-11 20:57:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 527. [2024-10-11 20:57:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 444 states have (on average 1.2387387387387387) internal successors, (550), 458 states have internal predecessors, (550), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-11 20:57:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 684 transitions. [2024-10-11 20:57:36,370 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 684 transitions. Word has length 77 [2024-10-11 20:57:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 684 transitions. [2024-10-11 20:57:36,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 20:57:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 684 transitions. [2024-10-11 20:57:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 20:57:36,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:36,372 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:36,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 20:57:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:57:36,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1730098740, now seen corresponding path program 1 times [2024-10-11 20:57:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517119922] [2024-10-11 20:57:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868565580] [2024-10-11 20:57:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:36,588 INFO L229 MonitoredProcess]: Starting monitored process 16 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:57:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 20:57:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:36,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 20:57:36,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 20:57:36,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517119922] [2024-10-11 20:57:37,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868565580] [2024-10-11 20:57:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868565580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:37,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-11 20:57:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732995807] [2024-10-11 20:57:37,283 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:57:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:57:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:57:37,284 INFO L87 Difference]: Start difference. First operand 527 states and 684 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:57:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:37,614 INFO L93 Difference]: Finished difference Result 547 states and 696 transitions. [2024-10-11 20:57:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:57:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 91 [2024-10-11 20:57:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:37,617 INFO L225 Difference]: With dead ends: 547 [2024-10-11 20:57:37,617 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 20:57:37,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:57:37,618 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:37,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 198 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:57:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 20:57:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2024-10-11 20:57:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 352 states have (on average 1.2272727272727273) internal successors, (432), 366 states have internal predecessors, (432), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-11 20:57:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 542 transitions. [2024-10-11 20:57:37,646 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 542 transitions. Word has length 91 [2024-10-11 20:57:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:37,646 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 542 transitions. [2024-10-11 20:57:37,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:57:37,647 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 542 transitions. [2024-10-11 20:57:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 20:57:37,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:37,648 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:37,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 20:57:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:37,848 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash 472549654, now seen corresponding path program 1 times [2024-10-11 20:57:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354715523] [2024-10-11 20:57:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 20:57:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 20:57:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:57:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-11 20:57:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354715523] [2024-10-11 20:57:37,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354715523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:37,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:57:37,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:57:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656570434] [2024-10-11 20:57:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:37,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:57:37,980 INFO L87 Difference]: Start difference. First operand 423 states and 542 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:57:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:38,300 INFO L93 Difference]: Finished difference Result 425 states and 542 transitions. [2024-10-11 20:57:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:57:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2024-10-11 20:57:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:38,302 INFO L225 Difference]: With dead ends: 425 [2024-10-11 20:57:38,303 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 20:57:38,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:57:38,303 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:38,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 182 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 20:57:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-10-11 20:57:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 324 states have (on average 1.2407407407407407) internal successors, (402), 337 states have internal predecessors, (402), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 20:57:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2024-10-11 20:57:38,328 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 93 [2024-10-11 20:57:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2024-10-11 20:57:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:57:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2024-10-11 20:57:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 20:57:38,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:38,329 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2024-10-11 20:57:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 20:57:38,329 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -792946040, now seen corresponding path program 1 times [2024-10-11 20:57:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020177473] [2024-10-11 20:57:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 20:57:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:57:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:57:38,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020177473] [2024-10-11 20:57:38,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020177473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:38,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059936472] [2024-10-11 20:57:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:38,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:38,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:38,413 INFO L229 MonitoredProcess]: Starting monitored process 17 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:57:38,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 20:57:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:38,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:38,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:57:38,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:57:38,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059936472] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:38,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 20:57:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30990735] [2024-10-11 20:57:38,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:38,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:57:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:38,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:57:38,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:57:38,617 INFO L87 Difference]: Start difference. First operand 390 states and 504 transitions. Second operand has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 20:57:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:38,873 INFO L93 Difference]: Finished difference Result 796 states and 1027 transitions. [2024-10-11 20:57:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:57:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 95 [2024-10-11 20:57:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:38,877 INFO L225 Difference]: With dead ends: 796 [2024-10-11 20:57:38,877 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 20:57:38,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:57:38,878 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 214 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:38,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 341 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 20:57:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 540. [2024-10-11 20:57:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 450 states have (on average 1.2444444444444445) internal successors, (560), 463 states have internal predecessors, (560), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:57:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 710 transitions. [2024-10-11 20:57:38,908 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 710 transitions. Word has length 95 [2024-10-11 20:57:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:38,909 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 710 transitions. [2024-10-11 20:57:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-11 20:57:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 710 transitions. [2024-10-11 20:57:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 20:57:38,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:38,910 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:38,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 20:57:39,111 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1070794258, now seen corresponding path program 2 times [2024-10-11 20:57:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:39,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633509917] [2024-10-11 20:57:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:57:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633509917] [2024-10-11 20:57:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633509917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264348137] [2024-10-11 20:57:39,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:57:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:39,403 INFO L229 MonitoredProcess]: Starting monitored process 18 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:57:39,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 20:57:39,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:57:39,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:39,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 20:57:39,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 20:57:39,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264348137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:40,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:57:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-11 20:57:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295702039] [2024-10-11 20:57:40,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 20:57:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 20:57:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:57:40,592 INFO L87 Difference]: Start difference. First operand 540 states and 710 transitions. Second operand has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-11 20:57:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:41,609 INFO L93 Difference]: Finished difference Result 656 states and 850 transitions. [2024-10-11 20:57:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:57:41,610 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 100 [2024-10-11 20:57:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:41,611 INFO L225 Difference]: With dead ends: 656 [2024-10-11 20:57:41,611 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 20:57:41,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=425, Invalid=1645, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 20:57:41,613 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 410 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:41,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 414 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:57:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 20:57:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2024-10-11 20:57:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.2) internal successors, (198), 173 states have internal predecessors, (198), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 20:57:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 252 transitions. [2024-10-11 20:57:41,635 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 252 transitions. Word has length 100 [2024-10-11 20:57:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 252 transitions. [2024-10-11 20:57:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-11 20:57:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2024-10-11 20:57:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 20:57:41,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:41,636 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:41,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 20:57:41,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:41,837 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:41,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash 844945041, now seen corresponding path program 2 times [2024-10-11 20:57:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524160731] [2024-10-11 20:57:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:41,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524160731] [2024-10-11 20:57:41,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524160731] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363927277] [2024-10-11 20:57:41,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:57:41,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:41,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:41,933 INFO L229 MonitoredProcess]: Starting monitored process 19 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:57:41,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 20:57:41,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:57:41,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:41,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:41,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:42,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363927277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:42,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-10-11 20:57:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266806617] [2024-10-11 20:57:42,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:42,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:57:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:57:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:57:42,156 INFO L87 Difference]: Start difference. First operand 202 states and 252 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 20:57:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:42,213 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2024-10-11 20:57:42,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:57:42,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 114 [2024-10-11 20:57:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:42,214 INFO L225 Difference]: With dead ends: 209 [2024-10-11 20:57:42,214 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 20:57:42,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:57:42,215 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:42,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:57:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 20:57:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-11 20:57:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.1939393939393939) internal successors, (197), 173 states have internal predecessors, (197), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 20:57:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2024-10-11 20:57:42,226 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 114 [2024-10-11 20:57:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2024-10-11 20:57:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-11 20:57:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2024-10-11 20:57:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 20:57:42,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:42,227 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:42,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 20:57:42,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 20:57:42,430 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash -969840553, now seen corresponding path program 1 times [2024-10-11 20:57:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049358131] [2024-10-11 20:57:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:57:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:57:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049358131] [2024-10-11 20:57:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049358131] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161046815] [2024-10-11 20:57:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:42,599 INFO L229 MonitoredProcess]: Starting monitored process 20 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:57:42,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 20:57:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:42,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:57:42,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:42,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161046815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:43,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-10-11 20:57:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793037860] [2024-10-11 20:57:43,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 20:57:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 20:57:43,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:57:43,155 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand has 22 states, 21 states have (on average 7.428571428571429) internal successors, (156), 22 states have internal predecessors, (156), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-11 20:57:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:43,443 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2024-10-11 20:57:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:57:43,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.428571428571429) internal successors, (156), 22 states have internal predecessors, (156), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 116 [2024-10-11 20:57:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:43,444 INFO L225 Difference]: With dead ends: 261 [2024-10-11 20:57:43,444 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 20:57:43,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 20:57:43,445 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 365 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:43,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 365 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 20:57:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2024-10-11 20:57:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 139 states have internal predecessors, (158), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:57:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2024-10-11 20:57:43,455 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 116 [2024-10-11 20:57:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2024-10-11 20:57:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.428571428571429) internal successors, (156), 22 states have internal predecessors, (156), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-11 20:57:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2024-10-11 20:57:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 20:57:43,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:43,456 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:43,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-11 20:57:43,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:43,657 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:43,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1896291402, now seen corresponding path program 1 times [2024-10-11 20:57:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626487206] [2024-10-11 20:57:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2024-10-11 20:57:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626487206] [2024-10-11 20:57:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626487206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042999762] [2024-10-11 20:57:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:43,836 INFO L229 MonitoredProcess]: Starting monitored process 21 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:57:43,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 20:57:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:43,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:57:43,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:44,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:45,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042999762] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:45,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 20 [2024-10-11 20:57:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073428273] [2024-10-11 20:57:45,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:45,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 20:57:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 20:57:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:57:45,921 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 21 states, 20 states have (on average 8.05) internal successors, (161), 21 states have internal predecessors, (161), 11 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 11 states have call predecessors, (36), 11 states have call successors, (36) [2024-10-11 20:57:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:46,079 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2024-10-11 20:57:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:57:46,080 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 8.05) internal successors, (161), 21 states have internal predecessors, (161), 11 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 11 states have call predecessors, (36), 11 states have call successors, (36) Word has length 121 [2024-10-11 20:57:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:46,081 INFO L225 Difference]: With dead ends: 167 [2024-10-11 20:57:46,081 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 20:57:46,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:57:46,082 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:46,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 222 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 20:57:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-10-11 20:57:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 138 states have internal predecessors, (156), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 20:57:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-10-11 20:57:46,092 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 121 [2024-10-11 20:57:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-10-11 20:57:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 8.05) internal successors, (161), 21 states have internal predecessors, (161), 11 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 11 states have call predecessors, (36), 11 states have call successors, (36) [2024-10-11 20:57:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-10-11 20:57:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 20:57:46,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:46,093 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:46,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-11 20:57:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 20:57:46,298 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1344508799, now seen corresponding path program 1 times [2024-10-11 20:57:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603298764] [2024-10-11 20:57:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603298764] [2024-10-11 20:57:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603298764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748732679] [2024-10-11 20:57:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:46,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:46,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:46,509 INFO L229 MonitoredProcess]: Starting monitored process 22 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:57:46,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-11 20:57:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:46,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:57:46,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:46,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:47,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748732679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:57:47,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:57:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-10-11 20:57:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057915317] [2024-10-11 20:57:47,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:47,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 20:57:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 20:57:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:57:47,935 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 22 states, 21 states have (on average 8.095238095238095) internal successors, (170), 22 states have internal predecessors, (170), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-11 20:57:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:48,408 INFO L93 Difference]: Finished difference Result 293 states and 369 transitions. [2024-10-11 20:57:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:57:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 8.095238095238095) internal successors, (170), 22 states have internal predecessors, (170), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 122 [2024-10-11 20:57:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:48,410 INFO L225 Difference]: With dead ends: 293 [2024-10-11 20:57:48,410 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 20:57:48,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=474, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:57:48,412 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 283 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:48,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 420 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:57:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 20:57:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 239. [2024-10-11 20:57:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.2261306532663316) internal successors, (244), 206 states have internal predecessors, (244), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 20:57:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 306 transitions. [2024-10-11 20:57:48,430 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 306 transitions. Word has length 122 [2024-10-11 20:57:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:48,430 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 306 transitions. [2024-10-11 20:57:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 8.095238095238095) internal successors, (170), 22 states have internal predecessors, (170), 12 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-11 20:57:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 306 transitions. [2024-10-11 20:57:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 20:57:48,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:48,432 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:57:48,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-11 20:57:48,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:48,633 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:48,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash -712197727, now seen corresponding path program 2 times [2024-10-11 20:57:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385428808] [2024-10-11 20:57:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 20:57:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385428808] [2024-10-11 20:57:48,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385428808] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:48,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356501141] [2024-10-11 20:57:48,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:57:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:48,927 INFO L229 MonitoredProcess]: Starting monitored process 23 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:57:48,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-11 20:57:48,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:57:48,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:48,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:57:48,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-11 20:57:49,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:57:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356501141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:57:49,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:49,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 20:57:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695990337] [2024-10-11 20:57:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:57:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:57:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:49,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:57:49,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:57:49,052 INFO L87 Difference]: Start difference. First operand 239 states and 306 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:49,151 INFO L93 Difference]: Finished difference Result 239 states and 306 transitions. [2024-10-11 20:57:49,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:57:49,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 124 [2024-10-11 20:57:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:49,153 INFO L225 Difference]: With dead ends: 239 [2024-10-11 20:57:49,153 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 20:57:49,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:57:49,153 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:49,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 74 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:57:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 20:57:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-11 20:57:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.185929648241206) internal successors, (236), 205 states have internal predecessors, (236), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 20:57:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 298 transitions. [2024-10-11 20:57:49,169 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 298 transitions. Word has length 124 [2024-10-11 20:57:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:49,169 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 298 transitions. [2024-10-11 20:57:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 20:57:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 298 transitions. [2024-10-11 20:57:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 20:57:49,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:49,170 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:49,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-11 20:57:49,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:49,375 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:49,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash -536642963, now seen corresponding path program 1 times [2024-10-11 20:57:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471089163] [2024-10-11 20:57:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053484990] [2024-10-11 20:57:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:49,398 INFO L229 MonitoredProcess]: Starting monitored process 24 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:57:49,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-11 20:57:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:49,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 20:57:49,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:57:49,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471089163] [2024-10-11 20:57:50,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053484990] [2024-10-11 20:57:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053484990] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:50,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:50,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 20:57:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351821084] [2024-10-11 20:57:50,031 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:50,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:57:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:57:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:57:50,031 INFO L87 Difference]: Start difference. First operand 238 states and 298 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:50,313 INFO L93 Difference]: Finished difference Result 264 states and 329 transitions. [2024-10-11 20:57:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:57:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 137 [2024-10-11 20:57:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:50,314 INFO L225 Difference]: With dead ends: 264 [2024-10-11 20:57:50,314 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 20:57:50,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:57:50,315 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:50,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 264 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 20:57:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2024-10-11 20:57:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.1830985915492958) internal successors, (252), 219 states have internal predecessors, (252), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:57:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 318 transitions. [2024-10-11 20:57:50,344 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 318 transitions. Word has length 137 [2024-10-11 20:57:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:50,344 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 318 transitions. [2024-10-11 20:57:50,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 318 transitions. [2024-10-11 20:57:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 20:57:50,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:50,345 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:50,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:50,550 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash 543937458, now seen corresponding path program 1 times [2024-10-11 20:57:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357700840] [2024-10-11 20:57:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:57:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621890987] [2024-10-11 20:57:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:50,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:50,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:50,571 INFO L229 MonitoredProcess]: Starting monitored process 25 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:57:50,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-11 20:57:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:50,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 20:57:50,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:57:50,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357700840] [2024-10-11 20:57:52,460 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:57:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621890987] [2024-10-11 20:57:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621890987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:52,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:57:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-10-11 20:57:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743182315] [2024-10-11 20:57:52,461 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:52,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:57:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:57:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:57:52,462 INFO L87 Difference]: Start difference. First operand 254 states and 318 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:52,784 INFO L93 Difference]: Finished difference Result 265 states and 329 transitions. [2024-10-11 20:57:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:57:52,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 138 [2024-10-11 20:57:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:52,787 INFO L225 Difference]: With dead ends: 265 [2024-10-11 20:57:52,787 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 20:57:52,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:57:52,788 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:52,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 340 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:57:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 20:57:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2024-10-11 20:57:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 214 states have (on average 1.1822429906542056) internal successors, (253), 220 states have internal predecessors, (253), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:57:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 319 transitions. [2024-10-11 20:57:52,807 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 319 transitions. Word has length 138 [2024-10-11 20:57:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 319 transitions. [2024-10-11 20:57:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 20:57:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 319 transitions. [2024-10-11 20:57:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 20:57:52,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:52,808 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:52,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:53,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 20:57:53,009 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1262108844, now seen corresponding path program 1 times [2024-10-11 20:57:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506456468] [2024-10-11 20:57:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:53,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:57:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:57:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:57:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506456468] [2024-10-11 20:57:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506456468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046377969] [2024-10-11 20:57:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:53,250 INFO L229 MonitoredProcess]: Starting monitored process 26 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:57:53,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-11 20:57:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:53,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 20:57:53,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:57:53,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046377969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:53,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:57:53,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2024-10-11 20:57:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934720415] [2024-10-11 20:57:53,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:53,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:57:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:57:53,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:57:53,554 INFO L87 Difference]: Start difference. First operand 255 states and 319 transitions. Second operand has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-11 20:57:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:54,054 INFO L93 Difference]: Finished difference Result 370 states and 466 transitions. [2024-10-11 20:57:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 20:57:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) Word has length 140 [2024-10-11 20:57:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:54,056 INFO L225 Difference]: With dead ends: 370 [2024-10-11 20:57:54,056 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 20:57:54,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:57:54,056 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 213 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:54,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 563 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:57:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 20:57:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 271. [2024-10-11 20:57:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 228 states have (on average 1.1754385964912282) internal successors, (268), 234 states have internal predecessors, (268), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 20:57:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 338 transitions. [2024-10-11 20:57:54,092 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 338 transitions. Word has length 140 [2024-10-11 20:57:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 338 transitions. [2024-10-11 20:57:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-11 20:57:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 338 transitions. [2024-10-11 20:57:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 20:57:54,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:54,095 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:54,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-11 20:57:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 20:57:54,299 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1074607603, now seen corresponding path program 3 times [2024-10-11 20:57:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:54,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266586237] [2024-10-11 20:57:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 20:57:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:57:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 33 proven. 31 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 20:57:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266586237] [2024-10-11 20:57:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266586237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992449948] [2024-10-11 20:57:54,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:57:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:54,587 INFO L229 MonitoredProcess]: Starting monitored process 27 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:57:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-11 20:57:54,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:57:54,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:54,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 20:57:54,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 99 proven. 26 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-10-11 20:57:54,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992449948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:55,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:57:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2024-10-11 20:57:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140322147] [2024-10-11 20:57:55,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:57:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:57:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:57:55,060 INFO L87 Difference]: Start difference. First operand 271 states and 338 transitions. Second operand has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 17 states have internal predecessors, (124), 10 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 20:57:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:55,803 INFO L93 Difference]: Finished difference Result 418 states and 527 transitions. [2024-10-11 20:57:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 20:57:55,806 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 17 states have internal predecessors, (124), 10 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 141 [2024-10-11 20:57:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:55,808 INFO L225 Difference]: With dead ends: 418 [2024-10-11 20:57:55,808 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 20:57:55,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=412, Invalid=1480, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 20:57:55,809 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 412 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:55,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 243 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 20:57:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 244. [2024-10-11 20:57:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 206 states have (on average 1.1116504854368932) internal successors, (229), 209 states have internal predecessors, (229), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 20:57:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 295 transitions. [2024-10-11 20:57:55,829 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 295 transitions. Word has length 141 [2024-10-11 20:57:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:55,830 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 295 transitions. [2024-10-11 20:57:55,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 17 states have internal predecessors, (124), 10 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-10-11 20:57:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 295 transitions. [2024-10-11 20:57:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 20:57:55,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:57:55,831 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:55,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-10-11 20:57:56,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:56,036 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-11 20:57:56,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:57:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 379298702, now seen corresponding path program 2 times [2024-10-11 20:57:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:57:56,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338938973] [2024-10-11 20:57:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:57:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:57:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:57:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:57:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 20:57:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:57:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:57:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:57:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:57:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:57:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:57:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:57:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 20:57:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:57:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:57:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 20:57:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:57:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 20:57:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 20:57:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:57:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 40 proven. 60 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 20:57:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:57:56,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338938973] [2024-10-11 20:57:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338938973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:56,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562540707] [2024-10-11 20:57:56,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:57:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:56,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:57:56,301 INFO L229 MonitoredProcess]: Starting monitored process 28 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:57:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-11 20:57:56,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:57:56,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:57:56,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 20:57:56,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:57:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 202 proven. 60 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-11 20:57:56,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:57:57,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562540707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:57:57,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:57:57,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16] total 20 [2024-10-11 20:57:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73826058] [2024-10-11 20:57:57,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:57:57,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 20:57:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:57:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 20:57:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:57:57,033 INFO L87 Difference]: Start difference. First operand 244 states and 295 transitions. Second operand has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-11 20:57:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:57:57,332 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2024-10-11 20:57:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:57:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 161 [2024-10-11 20:57:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:57:57,333 INFO L225 Difference]: With dead ends: 250 [2024-10-11 20:57:57,333 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:57:57,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:57:57,334 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:57:57,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 165 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:57:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:57:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:57:57,335 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:57:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:57:57,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2024-10-11 20:57:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:57:57,335 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:57:57,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 9 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-11 20:57:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:57:57,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:57:57,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-10-11 20:57:57,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-10-11 20:57:57,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-10-11 20:57:57,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-10-11 20:57:57,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-10-11 20:57:57,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-10-11 20:57:57,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-10-11 20:57:57,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-10-11 20:57:57,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-10-11 20:57:57,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-11 20:57:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,28 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:57:57,548 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:57:57,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:57:58,114 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:57:58,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:57:58 BoogieIcfgContainer [2024-10-11 20:57:58,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:57:58,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:57:58,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:57:58,132 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:57:58,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:57:22" (3/4) ... [2024-10-11 20:57:58,134 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:57:58,137 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:57:58,141 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 20:57:58,141 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 20:57:58,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:57:58,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:57:58,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:57:58,236 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:57:58,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:57:58,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:57:58,239 INFO L158 Benchmark]: Toolchain (without parser) took 36886.90ms. Allocated memory was 155.2MB in the beginning and 408.9MB in the end (delta: 253.8MB). Free memory was 98.9MB in the beginning and 174.5MB in the end (delta: -75.6MB). Peak memory consumption was 177.2MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,239 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 92.3MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:57:58,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.15ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 123.1MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.74ms. Allocated memory is still 155.2MB. Free memory was 123.1MB in the beginning and 121.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:57:58,239 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,240 INFO L158 Benchmark]: RCFGBuilder took 441.89ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 103.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,240 INFO L158 Benchmark]: TraceAbstraction took 35968.05ms. Allocated memory was 155.2MB in the beginning and 408.9MB in the end (delta: 253.8MB). Free memory was 102.2MB in the beginning and 179.7MB in the end (delta: -77.5MB). Peak memory consumption was 177.9MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,240 INFO L158 Benchmark]: Witness Printer took 104.84ms. Allocated memory is still 408.9MB. Free memory was 179.7MB in the beginning and 174.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:57:58,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.79ms. Allocated memory is still 92.3MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.15ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 123.1MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.74ms. Allocated memory is still 155.2MB. Free memory was 123.1MB in the beginning and 121.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 155.2MB. Free memory was 121.8MB in the beginning and 119.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.89ms. Allocated memory is still 155.2MB. Free memory was 119.7MB in the beginning and 103.0MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35968.05ms. Allocated memory was 155.2MB in the beginning and 408.9MB in the end (delta: 253.8MB). Free memory was 102.2MB in the beginning and 179.7MB in the end (delta: -77.5MB). Peak memory consumption was 177.9MB. Max. memory is 16.1GB. * Witness Printer took 104.84ms. Allocated memory is still 408.9MB. Free memory was 179.7MB in the beginning and 174.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: 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, 69 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 36, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4050 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3934 mSDsluCounter, 6573 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4727 mSDsCounter, 630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9139 IncrementalHoareTripleChecker+Invalid, 9769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 630 mSolverCounterUnsat, 1846 mSDtfsCounter, 9139 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3909 GetRequests, 3474 SyntacticMatches, 11 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=25, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 933 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 5127 NumberOfCodeBlocks, 4950 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 4941 ConstructedInterpolants, 0 QuantifiedInterpolants, 24603 SizeOfPredicates, 34 NumberOfNonLiveVariables, 4803 ConjunctsInSsa, 296 ConjunctsInUnsatCore, 58 InterpolantComputations, 18 PerfectInterpolantSequences, 12031/13221 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 24 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((((((d == 1) && (p == 1)) && (r == 0)) && (q == 0)) && (A <= 2)) && (B == 1)) && (0 <= A)) || ((((((2 == A) && (2 == p)) && (r == 0)) && (2 == q)) && (B == 1)) && (2 == d))) || ((((((p == 4) && (2 == A)) && (q == 0)) && (d == 4)) && (2 == r)) && (B == 1))) || ((((((((d == 1) && (1 <= q)) && (p == 1)) && (r == 0)) && (A <= 2)) && (B == 1)) && (q <= 2147483647)) && (0 <= A))) || ((((((((r <= 1) && (2 == p)) && (0 <= r)) && (q == 0)) && (A <= 2)) && (B == 1)) && (0 <= A)) && (2 == d))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((r <= A) && (2 == p)) && (0 <= r)) && (q == 0)) && (A <= 2)) && (B == 1)) && (2 == d)) || (((((((d == 1) && (p == 1)) && (q == 0)) && (A <= 2)) && (A == r)) && (B == 1)) && (0 <= A))) || ((((((p == 4) && (2 == A)) && (q == 0)) && (d == 4)) && (2 == r)) && (B == 1))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:57:58,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE