./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:00:20,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:00:20,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:00:20,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:00:20,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:00:20,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:00:20,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:00:20,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:00:20,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:00:20,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:00:20,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:00:20,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:00:20,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:00:20,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:00:20,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:00:20,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:00:20,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:00:20,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:00:20,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:00:20,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:00:20,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:00:20,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:00:20,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:00:20,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:00:20,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:00:20,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:00:20,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:00:20,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:00:20,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:20,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:00:20,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:00:20,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:00:20,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:00:20,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:00:20,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:00:20,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:00:20,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:00:20,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:00:20,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2024-11-12 17:00:20,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:00:20,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:00:20,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:00:20,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:00:20,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:00:20,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-11-12 17:00:22,001 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:00:22,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:00:22,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-11-12 17:00:22,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8549f941/e268fb93d65045738afffaf195a15bd6/FLAGdb59176f2 [2024-11-12 17:00:22,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8549f941/e268fb93d65045738afffaf195a15bd6 [2024-11-12 17:00:22,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:00:22,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:00:22,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:22,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:00:22,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:00:22,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:22" (1/1) ... [2024-11-12 17:00:22,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdd3d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:22, skipping insertion in model container [2024-11-12 17:00:22,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:22" (1/1) ... [2024-11-12 17:00:22,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:00:22,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:22,934 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:00:22,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:23,022 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:00:23,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23 WrapperNode [2024-11-12 17:00:23,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:23,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:23,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:00:23,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:00:23,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,086 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-12 17:00:23,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:23,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:00:23,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:00:23,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:00:23,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,120 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-12 17:00:23,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:00:23,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:00:23,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:00:23,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:00:23,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (1/1) ... [2024-11-12 17:00:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:23,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 17:00:23,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 17:00:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:00:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:00:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:00:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:00:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-12 17:00:23,210 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-12 17:00:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 17:00:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:00:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:00:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:00:23,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:00:23,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:00:23,489 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-12 17:00:23,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:00:23,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:00:23,499 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 17:00:23,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:23 BoogieIcfgContainer [2024-11-12 17:00:23,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:00:23,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:00:23,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:00:23,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:00:23,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:00:22" (1/3) ... [2024-11-12 17:00:23,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5241f60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:23, skipping insertion in model container [2024-11-12 17:00:23,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:23" (2/3) ... [2024-11-12 17:00:23,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5241f60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:23, skipping insertion in model container [2024-11-12 17:00:23,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:23" (3/3) ... [2024-11-12 17:00:23,507 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2024-11-12 17:00:23,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:00:23,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-12 17:00:23,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:00:23,654 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;@63cab8db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:00:23,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-12 17:00:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 48 states have (on average 1.625) internal successors, (78), 62 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 17:00:23,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:23,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:23,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:23,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -409925391, now seen corresponding path program 1 times [2024-11-12 17:00:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246901606] [2024-11-12 17:00:23,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:00:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246901606] [2024-11-12 17:00:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246901606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:23,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:00:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213910854] [2024-11-12 17:00:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:00:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:00:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:23,919 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.625) internal successors, (78), 62 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:00:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:23,957 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2024-11-12 17:00:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:00:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 17:00:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:23,965 INFO L225 Difference]: With dead ends: 114 [2024-11-12 17:00:23,966 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 17:00:23,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:23,972 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:23,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 17:00:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-12 17:00:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2024-11-12 17:00:24,007 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 14 [2024-11-12 17:00:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:24,008 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2024-11-12 17:00:24,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:00:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2024-11-12 17:00:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 17:00:24,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:24,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:00:24,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:24,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash -419160601, now seen corresponding path program 1 times [2024-11-12 17:00:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143880457] [2024-11-12 17:00:24,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 17:00:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143880457] [2024-11-12 17:00:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143880457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:24,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:24,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679218479] [2024-11-12 17:00:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:24,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:00:24,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:00:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:24,140 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:00:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:24,179 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-12 17:00:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:00:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 17:00:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:24,185 INFO L225 Difference]: With dead ends: 95 [2024-11-12 17:00:24,185 INFO L226 Difference]: Without dead ends: 57 [2024-11-12 17:00:24,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:24,186 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:24,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-12 17:00:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-12 17:00:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-11-12 17:00:24,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 14 [2024-11-12 17:00:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:24,197 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-12 17:00:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 17:00:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-11-12 17:00:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 17:00:24,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:24,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:24,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:00:24,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -154583391, now seen corresponding path program 1 times [2024-11-12 17:00:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164017495] [2024-11-12 17:00:24,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:24,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164017495] [2024-11-12 17:00:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164017495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:24,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:24,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133724867] [2024-11-12 17:00:24,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:24,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:24,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,420 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:24,479 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-12 17:00:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-11-12 17:00:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:24,480 INFO L225 Difference]: With dead ends: 60 [2024-11-12 17:00:24,480 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 17:00:24,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,481 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 195 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:24,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 195 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 17:00:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-11-12 17:00:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-12 17:00:24,495 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 18 [2024-11-12 17:00:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-12 17:00:24,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-12 17:00:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 17:00:24,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:24,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:00:24,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash -497117776, now seen corresponding path program 1 times [2024-11-12 17:00:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664140272] [2024-11-12 17:00:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664140272] [2024-11-12 17:00:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664140272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074665289] [2024-11-12 17:00:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,662 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:24,706 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-12 17:00:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:24,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 19 [2024-11-12 17:00:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:24,707 INFO L225 Difference]: With dead ends: 60 [2024-11-12 17:00:24,707 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 17:00:24,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,708 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:24,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 17:00:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 17:00:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-12 17:00:24,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 19 [2024-11-12 17:00:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:24,713 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-12 17:00:24,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-12 17:00:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 17:00:24,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:24,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:00:24,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1495673341, now seen corresponding path program 1 times [2024-11-12 17:00:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995791147] [2024-11-12 17:00:24,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995791147] [2024-11-12 17:00:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995791147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087854312] [2024-11-12 17:00:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:24,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,792 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:24,840 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-12 17:00:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2024-11-12 17:00:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:24,845 INFO L225 Difference]: With dead ends: 84 [2024-11-12 17:00:24,845 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 17:00:24,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:24,846 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:24,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 124 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 17:00:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2024-11-12 17:00:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 58 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-11-12 17:00:24,851 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 24 [2024-11-12 17:00:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:24,851 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-11-12 17:00:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-11-12 17:00:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 17:00:24,852 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:24,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:24,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 17:00:24,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -878766618, now seen corresponding path program 1 times [2024-11-12 17:00:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065423174] [2024-11-12 17:00:24,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065423174] [2024-11-12 17:00:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065423174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404606994] [2024-11-12 17:00:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:24,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:24,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:24,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 17:00:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:00:25,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:25,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:25,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404606994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:25,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:25,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-12 17:00:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992632130] [2024-11-12 17:00:25,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:25,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:00:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:00:25,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:00:25,124 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:25,160 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-12 17:00:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:00:25,160 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-12 17:00:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:25,161 INFO L225 Difference]: With dead ends: 84 [2024-11-12 17:00:25,161 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 17:00:25,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:00:25,162 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:25,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 17:00:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2024-11-12 17:00:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-12 17:00:25,167 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 25 [2024-11-12 17:00:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:25,167 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-12 17:00:25,168 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-12 17:00:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 17:00:25,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:25,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:25,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 17:00:25,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 17:00:25,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:25,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1613839848, now seen corresponding path program 1 times [2024-11-12 17:00:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543698483] [2024-11-12 17:00:25,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:25,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:25,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543698483] [2024-11-12 17:00:25,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543698483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:25,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:25,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:00:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881338282] [2024-11-12 17:00:25,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:25,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:25,443 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:25,496 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-12 17:00:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 27 [2024-11-12 17:00:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:25,498 INFO L225 Difference]: With dead ends: 117 [2024-11-12 17:00:25,498 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 17:00:25,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:00:25,499 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:25,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 171 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 17:00:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2024-11-12 17:00:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-12 17:00:25,506 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 27 [2024-11-12 17:00:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-12 17:00:25,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-12 17:00:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 17:00:25,507 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:25,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:25,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 17:00:25,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:25,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 842747831, now seen corresponding path program 1 times [2024-11-12 17:00:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:25,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442941406] [2024-11-12 17:00:25,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:00:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 17:00:25,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442941406] [2024-11-12 17:00:25,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442941406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328294869] [2024-11-12 17:00:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:25,585 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-12 17:00:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:25,623 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-12 17:00:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:25,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 28 [2024-11-12 17:00:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:25,625 INFO L225 Difference]: With dead ends: 66 [2024-11-12 17:00:25,625 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 17:00:25,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:25,625 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:25,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 17:00:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 17:00:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.375) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 17:00:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-12 17:00:25,634 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 28 [2024-11-12 17:00:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-12 17:00:25,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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-11-12 17:00:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-12 17:00:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 17:00:25,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:25,639 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 17:00:25,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash 355379034, now seen corresponding path program 1 times [2024-11-12 17:00:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016163282] [2024-11-12 17:00:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 17:00:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 17:00:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016163282] [2024-11-12 17:00:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016163282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373238911] [2024-11-12 17:00:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:25,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:25,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:25,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 17:00:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:25,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:00:25,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:25,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373238911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-12 17:00:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935534690] [2024-11-12 17:00:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:25,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:00:25,987 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:00:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:26,004 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2024-11-12 17:00:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-12 17:00:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:26,005 INFO L225 Difference]: With dead ends: 116 [2024-11-12 17:00:26,005 INFO L226 Difference]: Without dead ends: 60 [2024-11-12 17:00:26,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:00:26,006 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:26,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-12 17:00:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-12 17:00:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-12 17:00:26,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 29 [2024-11-12 17:00:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-12 17:00:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 17:00:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-12 17:00:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 17:00:26,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:26,012 INFO L218 NwaCegarLoop]: trace histogram [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-11-12 17:00:26,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 17:00:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 17:00:26,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash -435507026, now seen corresponding path program 1 times [2024-11-12 17:00:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174618104] [2024-11-12 17:00:26,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:26,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174618104] [2024-11-12 17:00:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174618104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:26,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:00:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223238739] [2024-11-12 17:00:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:26,313 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:26,361 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-12 17:00:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-12 17:00:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:26,362 INFO L225 Difference]: With dead ends: 94 [2024-11-12 17:00:26,362 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 17:00:26,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:26,363 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:26,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 112 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 17:00:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2024-11-12 17:00:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-12 17:00:26,370 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2024-11-12 17:00:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:26,370 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-12 17:00:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-12 17:00:26,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 17:00:26,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:26,374 INFO L218 NwaCegarLoop]: trace histogram [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-11-12 17:00:26,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 17:00:26,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:26,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 37417512, now seen corresponding path program 1 times [2024-11-12 17:00:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:26,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484558777] [2024-11-12 17:00:26,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:26,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:26,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484558777] [2024-11-12 17:00:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484558777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193743275] [2024-11-12 17:00:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:26,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:26,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:26,463 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:26,513 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-12 17:00:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-12 17:00:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:26,514 INFO L225 Difference]: With dead ends: 76 [2024-11-12 17:00:26,516 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 17:00:26,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:26,516 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:26,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 162 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 17:00:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-11-12 17:00:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-12 17:00:26,524 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 30 [2024-11-12 17:00:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-12 17:00:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-12 17:00:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 17:00:26,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:26,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 17:00:26,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:26,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1986306538, now seen corresponding path program 1 times [2024-11-12 17:00:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:26,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612474669] [2024-11-12 17:00:26,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:26,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612474669] [2024-11-12 17:00:26,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612474669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:26,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799901321] [2024-11-12 17:00:26,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:26,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:26,634 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:26,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 17:00:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:26,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:26,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:26,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799901321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-12 17:00:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755192548] [2024-11-12 17:00:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:00:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:00:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:00:26,835 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:26,881 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-12 17:00:26,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:00:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-12 17:00:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:26,882 INFO L225 Difference]: With dead ends: 74 [2024-11-12 17:00:26,883 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 17:00:26,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:00:26,883 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:26,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 145 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 17:00:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-11-12 17:00:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-12 17:00:26,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 33 [2024-11-12 17:00:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:26,890 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-12 17:00:26,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-12 17:00:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 17:00:26,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:26,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:26,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:00:27,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:27,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:27,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1445960467, now seen corresponding path program 1 times [2024-11-12 17:00:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791887105] [2024-11-12 17:00:27,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 17:00:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791887105] [2024-11-12 17:00:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791887105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521610317] [2024-11-12 17:00:27,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:27,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:27,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:27,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 17:00:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:27,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:27,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521610317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:27,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2024-11-12 17:00:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710448883] [2024-11-12 17:00:27,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 17:00:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 17:00:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-12 17:00:27,471 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:27,573 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-12 17:00:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:00:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2024-11-12 17:00:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:27,574 INFO L225 Difference]: With dead ends: 73 [2024-11-12 17:00:27,574 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 17:00:27,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:00:27,575 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 194 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:27,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 188 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 17:00:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2024-11-12 17:00:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-12 17:00:27,578 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 34 [2024-11-12 17:00:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:27,578 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-12 17:00:27,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-12 17:00:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 17:00:27,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:27,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:27,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 17:00:27,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:27,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:27,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2001397551, now seen corresponding path program 1 times [2024-11-12 17:00:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720959971] [2024-11-12 17:00:27,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-12 17:00:27,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720959971] [2024-11-12 17:00:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720959971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:27,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:27,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:00:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056541235] [2024-11-12 17:00:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:27,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:00:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:00:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:27,833 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:27,851 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-12 17:00:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:00:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-12 17:00:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:27,852 INFO L225 Difference]: With dead ends: 60 [2024-11-12 17:00:27,852 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 17:00:27,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:27,853 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:27,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 131 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 17:00:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 17:00:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-11-12 17:00:27,856 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 36 [2024-11-12 17:00:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-11-12 17:00:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-11-12 17:00:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 17:00:27,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:27,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:27,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 17:00:27,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1913782017, now seen corresponding path program 1 times [2024-11-12 17:00:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181896029] [2024-11-12 17:00:27,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:27,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181896029] [2024-11-12 17:00:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181896029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:27,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239263927] [2024-11-12 17:00:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:28,030 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:28,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 17:00:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:00:28,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:28,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 17:00:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239263927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:28,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-12 17:00:28,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354823271] [2024-11-12 17:00:28,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 17:00:28,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 17:00:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 17:00:28,238 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,363 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-12 17:00:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 17:00:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-12 17:00:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,364 INFO L225 Difference]: With dead ends: 78 [2024-11-12 17:00:28,365 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 17:00:28,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-12 17:00:28,365 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 243 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 17:00:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2024-11-12 17:00:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-11-12 17:00:28,368 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 37 [2024-11-12 17:00:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,368 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-12 17:00:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-11-12 17:00:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 17:00:28,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,369 INFO L218 NwaCegarLoop]: trace histogram [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-11-12 17:00:28,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 17:00:28,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 17:00:28,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:28,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1654709195, now seen corresponding path program 1 times [2024-11-12 17:00:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610957535] [2024-11-12 17:00:28,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 17:00:28,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610957535] [2024-11-12 17:00:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610957535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:00:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862150391] [2024-11-12 17:00:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,650 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,691 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-11-12 17:00:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-12 17:00:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,692 INFO L225 Difference]: With dead ends: 81 [2024-11-12 17:00:28,692 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 17:00:28,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:00:28,693 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 17:00:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-12 17:00:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-11-12 17:00:28,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2024-11-12 17:00:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,696 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-11-12 17:00:28,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-11-12 17:00:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 17:00:28,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,697 INFO L218 NwaCegarLoop]: trace histogram [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-11-12 17:00:28,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 17:00:28,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2032730363, now seen corresponding path program 1 times [2024-11-12 17:00:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014642690] [2024-11-12 17:00:28,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 17:00:28,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014642690] [2024-11-12 17:00:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014642690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 17:00:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922610585] [2024-11-12 17:00:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:00:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:00:28,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:00:28,779 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,832 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-12 17:00:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:00:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 40 [2024-11-12 17:00:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,833 INFO L225 Difference]: With dead ends: 71 [2024-11-12 17:00:28,833 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 17:00:28,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:00:28,834 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 17:00:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-11-12 17:00:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2024-11-12 17:00:28,837 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 40 [2024-11-12 17:00:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,837 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2024-11-12 17:00:28,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2024-11-12 17:00:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 17:00:28,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 17:00:28,838 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -784426780, now seen corresponding path program 1 times [2024-11-12 17:00:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135046574] [2024-11-12 17:00:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 17:00:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135046574] [2024-11-12 17:00:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135046574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 17:00:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119653787] [2024-11-12 17:00:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:00:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:00:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,898 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:28,939 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-11-12 17:00:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:00:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 42 [2024-11-12 17:00:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:28,940 INFO L225 Difference]: With dead ends: 72 [2024-11-12 17:00:28,940 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 17:00:28,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:00:28,941 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:28,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 17:00:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-12 17:00:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-12 17:00:28,944 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 42 [2024-11-12 17:00:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:28,944 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-12 17:00:28,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-12 17:00:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 17:00:28,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:28,945 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 17:00:28,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 17:00:28,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:28,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash -297026545, now seen corresponding path program 1 times [2024-11-12 17:00:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229974711] [2024-11-12 17:00:28,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 17:00:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229974711] [2024-11-12 17:00:29,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229974711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:29,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493448946] [2024-11-12 17:00:29,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:29,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 17:00:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:29,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 17:00:29,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 17:00:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493448946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:29,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:29,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-12 17:00:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483615645] [2024-11-12 17:00:29,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:29,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:00:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:00:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:29,273 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:29,340 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-11-12 17:00:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:00:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-12 17:00:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:29,342 INFO L225 Difference]: With dead ends: 124 [2024-11-12 17:00:29,342 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 17:00:29,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:29,343 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:29,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 237 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 17:00:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 100. [2024-11-12 17:00:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2024-11-12 17:00:29,347 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 43 [2024-11-12 17:00:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:29,348 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2024-11-12 17:00:29,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2024-11-12 17:00:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 17:00:29,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:29,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:29,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 17:00:29,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:29,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 58990504, now seen corresponding path program 1 times [2024-11-12 17:00:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176247341] [2024-11-12 17:00:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176247341] [2024-11-12 17:00:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176247341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047214977] [2024-11-12 17:00:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:29,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:29,642 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:29,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 17:00:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:29,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:29,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:29,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047214977] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:29,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-12 17:00:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505222714] [2024-11-12 17:00:29,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 17:00:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 17:00:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:00:29,883 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:00:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:29,949 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-12 17:00:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:00:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-11-12 17:00:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:29,950 INFO L225 Difference]: With dead ends: 128 [2024-11-12 17:00:29,950 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 17:00:29,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:00:29,951 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 136 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:29,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 193 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 17:00:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 17:00:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.164835164835165) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-12 17:00:29,955 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 45 [2024-11-12 17:00:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:29,955 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-12 17:00:29,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 17:00:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-12 17:00:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 17:00:29,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:29,956 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-12 17:00:29,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 17:00:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,157 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1797694767, now seen corresponding path program 2 times [2024-11-12 17:00:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327397889] [2024-11-12 17:00:30,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327397889] [2024-11-12 17:00:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327397889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105957445] [2024-11-12 17:00:30,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:00:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:30,270 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:30,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 17:00:30,435 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 17:00:30,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:00:30,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:00:30,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:30,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 17:00:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105957445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:30,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-11-12 17:00:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191879834] [2024-11-12 17:00:30,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:30,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 17:00:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 17:00:30,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:30,504 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:30,574 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2024-11-12 17:00:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:00:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-12 17:00:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:30,575 INFO L225 Difference]: With dead ends: 171 [2024-11-12 17:00:30,575 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 17:00:30,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:00:30,576 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:30,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 210 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 17:00:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 17:00:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.148936170212766) internal successors, (108), 99 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-12 17:00:30,580 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 54 [2024-11-12 17:00:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:30,581 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-12 17:00:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-12 17:00:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 17:00:30,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:30,581 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:30,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 17:00:30,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-12 17:00:30,786 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:30,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2004193981, now seen corresponding path program 1 times [2024-11-12 17:00:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680199482] [2024-11-12 17:00:30,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 17:00:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680199482] [2024-11-12 17:00:30,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680199482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:30,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588025942] [2024-11-12 17:00:30,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:30,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:30,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:30,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:30,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 17:00:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:31,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:31,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:00:31,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588025942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:31,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:00:31,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-12 17:00:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736079733] [2024-11-12 17:00:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:31,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:00:31,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:00:31,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:00:31,163 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:31,215 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-12 17:00:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:00:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 57 [2024-11-12 17:00:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:31,216 INFO L225 Difference]: With dead ends: 103 [2024-11-12 17:00:31,216 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 17:00:31,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:00:31,217 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:31,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 134 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 17:00:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 17:00:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.127659574468085) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-12 17:00:31,221 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 57 [2024-11-12 17:00:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:31,221 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-12 17:00:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-12 17:00:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 17:00:31,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:31,222 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-11-12 17:00:31,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 17:00:31,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:31,423 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:31,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1692568555, now seen corresponding path program 1 times [2024-11-12 17:00:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144001973] [2024-11-12 17:00:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 17:00:31,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:31,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144001973] [2024-11-12 17:00:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144001973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:31,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:00:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212635025] [2024-11-12 17:00:31,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:31,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:00:31,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:31,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:00:31,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:31,480 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:31,499 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-12 17:00:31,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:00:31,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 60 [2024-11-12 17:00:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:31,500 INFO L225 Difference]: With dead ends: 101 [2024-11-12 17:00:31,500 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 17:00:31,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 17:00:31,501 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:31,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 17:00:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 17:00:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-12 17:00:31,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 60 [2024-11-12 17:00:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:31,505 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-12 17:00:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-12 17:00:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 17:00:31,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:31,506 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:31,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 17:00:31,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash 930017774, now seen corresponding path program 1 times [2024-11-12 17:00:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309745040] [2024-11-12 17:00:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:31,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309745040] [2024-11-12 17:00:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309745040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:31,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735015238] [2024-11-12 17:00:31,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:31,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:31,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:31,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:31,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 17:00:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:31,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 17:00:31,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:31,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735015238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:31,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-12 17:00:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834491432] [2024-11-12 17:00:31,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 17:00:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:31,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 17:00:31,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-12 17:00:31,988 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:32,112 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2024-11-12 17:00:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 17:00:32,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2024-11-12 17:00:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:32,113 INFO L225 Difference]: With dead ends: 110 [2024-11-12 17:00:32,113 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 17:00:32,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-12 17:00:32,114 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 50 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:32,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 248 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 17:00:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-12 17:00:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1063829787234043) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-12 17:00:32,119 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 61 [2024-11-12 17:00:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:32,119 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-12 17:00:32,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.214285714285714) internal successors, (73), 14 states have internal predecessors, (73), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-12 17:00:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 17:00:32,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:32,120 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:32,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 17:00:32,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 17:00:32,324 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1028948432, now seen corresponding path program 1 times [2024-11-12 17:00:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262156575] [2024-11-12 17:00:32,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262156575] [2024-11-12 17:00:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262156575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612158004] [2024-11-12 17:00:32,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:32,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:32,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:32,442 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 17:00:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:32,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 17:00:32,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:32,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-12 17:00:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612158004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:32,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-11-12 17:00:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490787907] [2024-11-12 17:00:32,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:32,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 17:00:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 17:00:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:00:32,702 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:32,783 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-11-12 17:00:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:00:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-12 17:00:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:32,785 INFO L225 Difference]: With dead ends: 113 [2024-11-12 17:00:32,785 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 17:00:32,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:00:32,785 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:32,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 229 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 17:00:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 17:00:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.105263157894737) internal successors, (105), 96 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-12 17:00:32,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 65 [2024-11-12 17:00:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:32,790 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-12 17:00:32,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-12 17:00:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 17:00:32,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:32,791 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:32,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 17:00:32,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-12 17:00:32,992 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:32,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1599978539, now seen corresponding path program 1 times [2024-11-12 17:00:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426873580] [2024-11-12 17:00:32,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 17:00:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426873580] [2024-11-12 17:00:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426873580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467194893] [2024-11-12 17:00:33,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:33,101 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:33,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 17:00:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 17:00:33,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 17:00:33,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 17:00:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467194893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:33,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:33,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-12 17:00:33,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801231603] [2024-11-12 17:00:33,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:33,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:00:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:33,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:00:33,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:33,376 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:33,453 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2024-11-12 17:00:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:00:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-12 17:00:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:33,455 INFO L225 Difference]: With dead ends: 140 [2024-11-12 17:00:33,455 INFO L226 Difference]: Without dead ends: 139 [2024-11-12 17:00:33,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:00:33,455 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 27 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:33,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 148 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-12 17:00:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-12 17:00:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0970149253731343) internal successors, (147), 135 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-12 17:00:33,462 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 68 [2024-11-12 17:00:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:33,463 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-12 17:00:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 17:00:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-12 17:00:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 17:00:33,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:33,463 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:33,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 17:00:33,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-12 17:00:33,664 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:33,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -107523168, now seen corresponding path program 2 times [2024-11-12 17:00:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837772290] [2024-11-12 17:00:33,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-12 17:00:33,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837772290] [2024-11-12 17:00:33,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837772290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:33,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482729997] [2024-11-12 17:00:33,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:00:33,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:33,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:33,841 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:33,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 17:00:34,017 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 17:00:34,017 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:00:34,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:00:34,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-12 17:00:34,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-12 17:00:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482729997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:34,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2024-11-12 17:00:34,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903480594] [2024-11-12 17:00:34,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 17:00:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:34,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 17:00:34,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:00:34,173 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 14 states, 14 states have (on average 8.142857142857142) internal successors, (114), 13 states have internal predecessors, (114), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:34,303 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2024-11-12 17:00:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:00:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.142857142857142) internal successors, (114), 13 states have internal predecessors, (114), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 79 [2024-11-12 17:00:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:34,305 INFO L225 Difference]: With dead ends: 203 [2024-11-12 17:00:34,305 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 17:00:34,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-12 17:00:34,305 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 39 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:34,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 230 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 17:00:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-12 17:00:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2024-11-12 17:00:34,310 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 79 [2024-11-12 17:00:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2024-11-12 17:00:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.142857142857142) internal successors, (114), 13 states have internal predecessors, (114), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2024-11-12 17:00:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-12 17:00:34,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:34,311 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2024-11-12 17:00:34,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 17:00:34,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 17:00:34,512 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 17:00:34,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1325714175, now seen corresponding path program 2 times [2024-11-12 17:00:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:34,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323770173] [2024-11-12 17:00:34,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:00:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 17:00:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 79 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 17:00:34,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323770173] [2024-11-12 17:00:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323770173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:00:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680197618] [2024-11-12 17:00:34,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:00:34,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:34,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:34,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 17:00:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 17:00:34,920 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 17:00:34,920 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:00:34,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 17:00:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:00:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-12 17:00:35,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:00:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-12 17:00:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680197618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:00:35,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:00:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 14 [2024-11-12 17:00:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37995610] [2024-11-12 17:00:35,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:00:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 17:00:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 17:00:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:00:35,158 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 13 states have internal predecessors, (134), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:35,328 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-12 17:00:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 17:00:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 13 states have internal predecessors, (134), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 107 [2024-11-12 17:00:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:35,329 INFO L225 Difference]: With dead ends: 103 [2024-11-12 17:00:35,329 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 17:00:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-12 17:00:35,329 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 282 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:00:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 17:00:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 17:00:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:00:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 17:00:35,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2024-11-12 17:00:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:35,330 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 17:00:35,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 13 states have internal predecessors, (134), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 17:00:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 17:00:35,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 17:00:35,333 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-11-12 17:00:35,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-11-12 17:00:35,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-11-12 17:00:35,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-11-12 17:00:35,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-11-12 17:00:35,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-11-12 17:00:35,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-12 17:00:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:00:35,541 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:35,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 17:00:35,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:00:35,705 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-12 17:00:35,706 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-12 17:00:35,707 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-12 17:00:35,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-12 17:00:35,708 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-12 17:00:35,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-12 17:00:35,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-11-12 17:00:35,709 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-11-12 17:00:35,712 WARN L156 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-12 17:00:35,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-12 17:00:35,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-12 17:00:35,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-12 17:00:35,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:00:35 BoogieIcfgContainer [2024-11-12 17:00:35,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:00:35,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:00:35,720 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:00:35,721 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:00:35,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:23" (3/4) ... [2024-11-12 17:00:35,723 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 17:00:35,726 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-12 17:00:35,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-12 17:00:35,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 17:00:35,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 17:00:35,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 17:00:35,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:00:35,838 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 17:00:35,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:00:35,839 INFO L158 Benchmark]: Toolchain (without parser) took 13244.98ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 92.7MB in the beginning and 118.6MB in the end (delta: -25.9MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,839 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:00:35,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.72ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 72.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.96ms. Allocated memory is still 165.7MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,840 INFO L158 Benchmark]: Boogie Preprocessor took 54.69ms. Allocated memory is still 165.7MB. Free memory was 70.3MB in the beginning and 67.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,840 INFO L158 Benchmark]: RCFGBuilder took 355.09ms. Allocated memory is still 165.7MB. Free memory was 67.1MB in the beginning and 47.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,840 INFO L158 Benchmark]: TraceAbstraction took 12218.77ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 47.2MB in the beginning and 123.8MB in the end (delta: -76.6MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,841 INFO L158 Benchmark]: Witness Printer took 118.32ms. Allocated memory is still 323.0MB. Free memory was 123.8MB in the beginning and 118.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 17:00:35,841 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.14ms. Allocated memory is still 121.6MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.72ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 72.4MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.96ms. Allocated memory is still 165.7MB. Free memory was 72.4MB in the beginning and 70.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.69ms. Allocated memory is still 165.7MB. Free memory was 70.3MB in the beginning and 67.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.09ms. Allocated memory is still 165.7MB. Free memory was 67.1MB in the beginning and 47.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12218.77ms. Allocated memory was 165.7MB in the beginning and 323.0MB in the end (delta: 157.3MB). Free memory was 47.2MB in the beginning and 123.8MB in the end (delta: -76.6MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 118.32ms. Allocated memory is still 323.0MB. Free memory was 123.8MB in the beginning and 118.6MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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, 66 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 886 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 884 mSDsluCounter, 4868 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3643 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2134 IncrementalHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 1225 mSDtfsCounter, 2134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1575 GetRequests, 1358 SyntacticMatches, 9 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=26, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 160 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2434 ConstructedInterpolants, 0 QuantifiedInterpolants, 5980 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3846 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 52 InterpolantComputations, 18 PerfectInterpolantSequences, 1208/1539 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 14 specifications checked. All of them hold - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((i == 0) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((len <= 1) && (len == 2)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: ((index <= 2147483648) || (index == 0)) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: ((index == 0) || (index <= 2147483648)) RESULT: Ultimate proved your program to be correct! [2024-11-12 17:00:35,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE