./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:09:50,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:09:50,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:09:50,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:09:50,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:09:50,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:09:50,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:09:50,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:09:50,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:09:50,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:09:50,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:09:50,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:09:50,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:09:50,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:09:50,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:09:50,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:09:50,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:09:50,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:09:50,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:09:50,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:09:50,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:09:50,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:09:50,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:09:50,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:09:50,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:09:50,416 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:09:50,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:09:50,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:09:50,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:09:50,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:09:50,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:09:50,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:09:50,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:09:50,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:09:50,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:50,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:09:50,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:09:50,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:09:50,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:09:50,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:09:50,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:09:50,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:09:50,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:09:50,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:09:50,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 [2024-10-11 20:09:50,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:09:50,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:09:50,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:09:50,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:09:50,668 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:09:50,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2024-10-11 20:09:52,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:09:52,292 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:09:52,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2024-10-11 20:09:52,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/065c57573/80e90f7f510c4d6cbf325cf3e84ba989/FLAG5767b5f14 [2024-10-11 20:09:52,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/065c57573/80e90f7f510c4d6cbf325cf3e84ba989 [2024-10-11 20:09:52,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:09:52,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:09:52,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:52,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:09:52,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:09:52,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d88b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52, skipping insertion in model container [2024-10-11 20:09:52,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:09:52,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:52,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:09:52,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:52,709 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:09:52,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52 WrapperNode [2024-10-11 20:09:52,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:52,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:52,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:09:52,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:09:52,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,760 INFO L138 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 130 [2024-10-11 20:09:52,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:52,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:09:52,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:09:52,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:09:52,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,788 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [5, 3]. 63 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 6 writes are split as follows [4, 2]. [2024-10-11 20:09:52,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:09:52,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:09:52,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:09:52,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:09:52,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (1/1) ... [2024-10-11 20:09:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:52,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:09:52,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:09:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:09:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:09:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:09:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:09:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:09:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:09:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:09:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:09:52,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:09:52,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:09:53,184 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-11 20:09:53,184 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:09:53,216 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:09:53,216 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:09:53,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:53 BoogieIcfgContainer [2024-10-11 20:09:53,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:09:53,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:09:53,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:09:53,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:09:53,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:52" (1/3) ... [2024-10-11 20:09:53,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4e086b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:53, skipping insertion in model container [2024-10-11 20:09:53,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:52" (2/3) ... [2024-10-11 20:09:53,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4e086b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:53, skipping insertion in model container [2024-10-11 20:09:53,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:53" (3/3) ... [2024-10-11 20:09:53,226 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-2.i [2024-10-11 20:09:53,243 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:09:53,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 20:09:53,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:09:53,315 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;@21a9c74a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:09:53,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 20:09:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:09:53,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:53,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:53,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:53,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1814357577, now seen corresponding path program 1 times [2024-10-11 20:09:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:53,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315962029] [2024-10-11 20:09:53,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:53,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315962029] [2024-10-11 20:09:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315962029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:53,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:53,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:53,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248611085] [2024-10-11 20:09:53,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:53,604 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 52 states have internal predecessors, (67), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:53,698 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2024-10-11 20:09:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:09:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:53,710 INFO L225 Difference]: With dead ends: 116 [2024-10-11 20:09:53,710 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 20:09:53,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:09:53,718 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:53,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 85 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 20:09:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-10-11 20:09:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-10-11 20:09:53,779 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 7 [2024-10-11 20:09:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-10-11 20:09:53,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-10-11 20:09:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:09:53,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:53,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:53,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:09:53,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1814297995, now seen corresponding path program 1 times [2024-10-11 20:09:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238631801] [2024-10-11 20:09:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238631801] [2024-10-11 20:09:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238631801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008026009] [2024-10-11 20:09:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:53,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:53,877 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:53,982 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-10-11 20:09:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:53,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:09:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:53,983 INFO L225 Difference]: With dead ends: 69 [2024-10-11 20:09:53,984 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 20:09:53,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:09:53,985 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 67 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:53,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 20:09:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2024-10-11 20:09:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-10-11 20:09:53,991 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 7 [2024-10-11 20:09:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-10-11 20:09:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-10-11 20:09:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:09:53,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:53,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:09:53,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash -410509979, now seen corresponding path program 1 times [2024-10-11 20:09:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381569527] [2024-10-11 20:09:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381569527] [2024-10-11 20:09:54,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381569527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:54,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869767844] [2024-10-11 20:09:54,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:54,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:54,042 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,185 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-10-11 20:09:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:09:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,186 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:09:54,186 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 20:09:54,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:09:54,187 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 76 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 20:09:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-10-11 20:09:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.56) internal successors, (78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-10-11 20:09:54,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 8 [2024-10-11 20:09:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,199 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-10-11 20:09:54,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-10-11 20:09:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:09:54,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:09:54,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1364497383, now seen corresponding path program 1 times [2024-10-11 20:09:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084770219] [2024-10-11 20:09:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084770219] [2024-10-11 20:09:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084770219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539025459] [2024-10-11 20:09:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:54,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:54,242 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,278 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-10-11 20:09:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:54,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:09:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,279 INFO L225 Difference]: With dead ends: 62 [2024-10-11 20:09:54,280 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 20:09:54,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:09:54,281 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 20:09:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2024-10-11 20:09:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-11 20:09:54,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2024-10-11 20:09:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,291 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-11 20:09:54,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-11 20:09:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:09:54,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:09:54,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1780359698, now seen corresponding path program 1 times [2024-10-11 20:09:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728673602] [2024-10-11 20:09:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728673602] [2024-10-11 20:09:54,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728673602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:09:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012328473] [2024-10-11 20:09:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:09:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:09:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:09:54,417 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,474 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-10-11 20:09:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:09:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:09:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,475 INFO L225 Difference]: With dead ends: 89 [2024-10-11 20:09:54,475 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 20:09:54,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:09:54,476 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 104 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 20:09:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2024-10-11 20:09:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 20:09:54,480 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2024-10-11 20:09:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,481 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 20:09:54,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 20:09:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:09:54,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:09:54,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1705260972, now seen corresponding path program 1 times [2024-10-11 20:09:54,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808334804] [2024-10-11 20:09:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808334804] [2024-10-11 20:09:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808334804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789361165] [2024-10-11 20:09:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:54,514 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,523 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-10-11 20:09:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:09:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,524 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:09:54,524 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:09:54,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:54,525 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:09:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-11 20:09:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-11 20:09:54,529 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2024-10-11 20:09:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,529 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-11 20:09:54,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-11 20:09:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:09:54,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:09:54,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1172376086, now seen corresponding path program 1 times [2024-10-11 20:09:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483327072] [2024-10-11 20:09:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483327072] [2024-10-11 20:09:54,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483327072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:09:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939937771] [2024-10-11 20:09:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:54,587 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,624 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-10-11 20:09:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:09:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,626 INFO L225 Difference]: With dead ends: 86 [2024-10-11 20:09:54,626 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 20:09:54,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:54,627 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 20:09:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2024-10-11 20:09:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-11 20:09:54,636 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 13 [2024-10-11 20:09:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,637 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-11 20:09:54,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-10-11 20:09:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:09:54,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:09:54,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash -914210648, now seen corresponding path program 1 times [2024-10-11 20:09:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367487000] [2024-10-11 20:09:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367487000] [2024-10-11 20:09:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367487000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315417399] [2024-10-11 20:09:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:54,696 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,716 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-11 20:09:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:09:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,717 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:09:54,717 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:09:54,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-11 20:09:54,718 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:09:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 20:09:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-10-11 20:09:54,722 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2024-10-11 20:09:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,723 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-11 20:09:54,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-10-11 20:09:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:09:54,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:09:54,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1984007470, now seen corresponding path program 1 times [2024-10-11 20:09:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062980083] [2024-10-11 20:09:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062980083] [2024-10-11 20:09:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062980083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:54,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476993498] [2024-10-11 20:09:54,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:54,754 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,776 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-10-11 20:09:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:09:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,777 INFO L225 Difference]: With dead ends: 50 [2024-10-11 20:09:54,778 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 20:09:54,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:54,778 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 20:09:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 20:09:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-10-11 20:09:54,783 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2024-10-11 20:09:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,783 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-10-11 20:09:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-10-11 20:09:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:09:54,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:09:54,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1374689331, now seen corresponding path program 1 times [2024-10-11 20:09:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43299077] [2024-10-11 20:09:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43299077] [2024-10-11 20:09:54,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43299077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:09:54,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976446471] [2024-10-11 20:09:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:54,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:54,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:54,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:54,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:09:54,840 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:54,907 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-11 20:09:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:09:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:54,908 INFO L225 Difference]: With dead ends: 65 [2024-10-11 20:09:54,908 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:09:54,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:09:54,909 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:54,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 105 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:09:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:09:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-11 20:09:54,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2024-10-11 20:09:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-11 20:09:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-11 20:09:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:09:54,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:54,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:09:54,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1909160715, now seen corresponding path program 1 times [2024-10-11 20:09:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815132455] [2024-10-11 20:09:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815132455] [2024-10-11 20:09:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815132455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541710623] [2024-10-11 20:09:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:55,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:55,004 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,032 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-10-11 20:09:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:09:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,032 INFO L225 Difference]: With dead ends: 73 [2024-10-11 20:09:55,033 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 20:09:55,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:55,033 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 20:09:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-11 20:09:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-11 20:09:55,044 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 15 [2024-10-11 20:09:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:55,044 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-11 20:09:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-11 20:09:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:09:55,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:55,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:55,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:09:55,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:55,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1322354701, now seen corresponding path program 1 times [2024-10-11 20:09:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296087536] [2024-10-11 20:09:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:55,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296087536] [2024-10-11 20:09:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296087536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:55,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:55,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:09:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83780402] [2024-10-11 20:09:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:55,084 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,096 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-11 20:09:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:09:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,098 INFO L225 Difference]: With dead ends: 60 [2024-10-11 20:09:55,098 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 20:09:55,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:55,099 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 20:09:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2024-10-11 20:09:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-11 20:09:55,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-10-11 20:09:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-11 20:09:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-11 20:09:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:09:55,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:55,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:55,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:09:55,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash 752417097, now seen corresponding path program 1 times [2024-10-11 20:09:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373502616] [2024-10-11 20:09:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:55,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373502616] [2024-10-11 20:09:55,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373502616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:55,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:55,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:09:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134017495] [2024-10-11 20:09:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:55,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:55,170 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,197 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-10-11 20:09:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 20:09:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,198 INFO L225 Difference]: With dead ends: 58 [2024-10-11 20:09:55,198 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:09:55,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:55,199 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:09:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-11 20:09:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-11 20:09:55,206 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 17 [2024-10-11 20:09:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:55,206 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-11 20:09:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-11 20:09:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:09:55,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:55,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:09:55,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -527446581, now seen corresponding path program 1 times [2024-10-11 20:09:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287755979] [2024-10-11 20:09:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:55,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287755979] [2024-10-11 20:09:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287755979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699056992] [2024-10-11 20:09:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:55,253 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,272 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-11 20:09:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:55,272 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 20:09:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,272 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:09:55,273 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:09:55,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10-11 20:09:55,273 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:09:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 20:09:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-10-11 20:09:55,280 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 17 [2024-10-11 20:09:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:55,282 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-11 20:09:55,282 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-10-11 20:09:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:09:55,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:55,283 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:55,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:09:55,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 827657113, now seen corresponding path program 1 times [2024-10-11 20:09:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314090666] [2024-10-11 20:09:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314090666] [2024-10-11 20:09:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314090666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:55,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993835057] [2024-10-11 20:09:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:55,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:09:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:55,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993835057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:09:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633623375] [2024-10-11 20:09:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:55,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:55,502 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,539 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-10-11 20:09:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 20:09:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,539 INFO L225 Difference]: With dead ends: 50 [2024-10-11 20:09:55,540 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 20:09:55,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:55,541 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 20:09:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 20:09:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-11 20:09:55,549 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 18 [2024-10-11 20:09:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:55,549 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-11 20:09:55,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-10-11 20:09:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:09:55,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:55,550 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:55,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:09:55,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:55,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -112433189, now seen corresponding path program 1 times [2024-10-11 20:09:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620473556] [2024-10-11 20:09:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620473556] [2024-10-11 20:09:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620473556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908553481] [2024-10-11 20:09:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:55,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:55,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:55,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:09:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:55,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:55,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:55,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908553481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:55,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:55,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:09:55,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527436465] [2024-10-11 20:09:55,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:55,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:55,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:55,955 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:55,986 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2024-10-11 20:09:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 20:09:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:55,988 INFO L225 Difference]: With dead ends: 80 [2024-10-11 20:09:55,988 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 20:09:55,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:55,989 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:55,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 20:09:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 20:09:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-10-11 20:09:56,001 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 19 [2024-10-11 20:09:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:56,001 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-10-11 20:09:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-10-11 20:09:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:09:56,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:56,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:56,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:09:56,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:09:56,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1387369631, now seen corresponding path program 1 times [2024-10-11 20:09:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414751735] [2024-10-11 20:09:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414751735] [2024-10-11 20:09:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414751735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:09:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821400653] [2024-10-11 20:09:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:56,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:09:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:09:56,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:09:56,350 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:56,452 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-10-11 20:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:09:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 20:09:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:56,453 INFO L225 Difference]: With dead ends: 92 [2024-10-11 20:09:56,453 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 20:09:56,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:09:56,454 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:56,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 20:09:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 20:09:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 76 states have (on average 1.144736842105263) internal successors, (87), 78 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2024-10-11 20:09:56,469 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 22 [2024-10-11 20:09:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:56,469 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2024-10-11 20:09:56,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2024-10-11 20:09:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:09:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:56,472 INFO L215 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] [2024-10-11 20:09:56,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:09:56,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:56,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1130203630, now seen corresponding path program 1 times [2024-10-11 20:09:56,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:56,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153782844] [2024-10-11 20:09:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:56,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153782844] [2024-10-11 20:09:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153782844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946494262] [2024-10-11 20:09:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:56,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:56,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:56,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:09:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:56,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:09:56,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:56,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946494262] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:57,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-10-11 20:09:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303291949] [2024-10-11 20:09:57,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 20:09:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 20:09:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-11 20:09:57,030 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:57,238 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-10-11 20:09:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:09:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 20:09:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:57,240 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:09:57,240 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 20:09:57,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:09:57,241 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 61 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 20:09:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-11 20:09:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 76 states have (on average 1.131578947368421) internal successors, (86), 78 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-10-11 20:09:57,248 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 27 [2024-10-11 20:09:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:57,248 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-10-11 20:09:57,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-10-11 20:09:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:09:57,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:57,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:57,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:09:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:57,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1085045633, now seen corresponding path program 2 times [2024-10-11 20:09:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130133900] [2024-10-11 20:09:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:09:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130133900] [2024-10-11 20:09:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130133900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306071710] [2024-10-11 20:09:57,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:57,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:57,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:57,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:09:57,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:09:57,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:57,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:57,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:09:57,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306071710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:57,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 20:09:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770291944] [2024-10-11 20:09:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:09:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:09:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:09:57,593 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:57,607 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2024-10-11 20:09:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 20:09:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:57,608 INFO L225 Difference]: With dead ends: 79 [2024-10-11 20:09:57,608 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:09:57,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:09:57,609 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:57,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:09:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 20:09:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.118421052631579) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-10-11 20:09:57,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 32 [2024-10-11 20:09:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:57,614 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-10-11 20:09:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-10-11 20:09:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 20:09:57,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:57,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:57,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:57,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:57,815 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash 723323851, now seen corresponding path program 1 times [2024-10-11 20:09:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:57,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848530882] [2024-10-11 20:09:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:09:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:57,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848530882] [2024-10-11 20:09:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848530882] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:57,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904300344] [2024-10-11 20:09:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:57,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:57,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:09:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:57,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:57,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:09:57,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 20:09:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904300344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:58,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:09:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23500585] [2024-10-11 20:09:58,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:58,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:58,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:58,002 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:58,034 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-10-11 20:09:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 20:09:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:58,035 INFO L225 Difference]: With dead ends: 94 [2024-10-11 20:09:58,035 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 20:09:58,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:58,036 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:58,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 20:09:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 20:09:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.098901098901099) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-10-11 20:09:58,041 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 33 [2024-10-11 20:09:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:58,042 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-10-11 20:09:58,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-10-11 20:09:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 20:09:58,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:58,042 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:58,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:09:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:58,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:58,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash -72489108, now seen corresponding path program 2 times [2024-10-11 20:09:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171599590] [2024-10-11 20:09:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:58,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171599590] [2024-10-11 20:09:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171599590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319397625] [2024-10-11 20:09:58,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:58,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:58,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:09:58,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:58,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:58,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:58,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 20:09:58,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 20:09:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319397625] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:58,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 15 [2024-10-11 20:09:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802848442] [2024-10-11 20:09:58,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:58,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:58,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:58,516 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:58,645 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-10-11 20:09:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:09:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 20:09:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:58,646 INFO L225 Difference]: With dead ends: 103 [2024-10-11 20:09:58,646 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 20:09:58,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:09:58,647 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:58,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 20:09:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2024-10-11 20:09:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-10-11 20:09:58,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 34 [2024-10-11 20:09:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-10-11 20:09:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-10-11 20:09:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 20:09:58,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:58,651 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:58,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:09:58,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 20:09:58,852 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:09:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1370133215, now seen corresponding path program 2 times [2024-10-11 20:09:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821767274] [2024-10-11 20:09:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:09:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821767274] [2024-10-11 20:09:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821767274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:59,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947243653] [2024-10-11 20:09:59,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:59,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:09:59,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:59,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:59,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:09:59,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 20:09:59,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 20:09:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947243653] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:59,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 23 [2024-10-11 20:09:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935246894] [2024-10-11 20:09:59,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:59,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 20:09:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 20:09:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-11 20:09:59,495 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:59,934 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 20:09:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 20:09:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 20:09:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:59,936 INFO L225 Difference]: With dead ends: 80 [2024-10-11 20:09:59,936 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:09:59,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 20:09:59,937 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 149 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:59,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 34 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:09:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:09:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:09:59,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-10-11 20:09:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:59,938 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:09:59,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:09:59,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:09:59,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-11 20:09:59,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-11 20:09:59,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-11 20:09:59,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-11 20:09:59,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-11 20:09:59,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-11 20:09:59,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-11 20:09:59,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-11 20:09:59,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:10:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:10:00,146 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:00,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:10:01,360 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:01,368 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short11 [2024-10-11 20:10:01,377 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short11 [2024-10-11 20:10:01,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:01 BoogieIcfgContainer [2024-10-11 20:10:01,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:01,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:01,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:01,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:01,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:53" (3/4) ... [2024-10-11 20:10:01,384 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:10:01,389 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 20:10:01,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:10:01,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:10:01,391 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:10:01,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:10:01,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:10:01,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:01,478 INFO L158 Benchmark]: Toolchain (without parser) took 9158.24ms. Allocated memory was 211.8MB in the beginning and 325.1MB in the end (delta: 113.2MB). Free memory was 183.1MB in the beginning and 202.1MB in the end (delta: -18.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,478 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:01,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.20ms. Allocated memory is still 211.8MB. Free memory was 182.9MB in the beginning and 167.4MB in the end (delta: 15.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.82ms. Allocated memory is still 211.8MB. Free memory was 167.4MB in the beginning and 165.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,479 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 211.8MB. Free memory was 165.4MB in the beginning and 163.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,479 INFO L158 Benchmark]: RCFGBuilder took 411.96ms. Allocated memory is still 211.8MB. Free memory was 163.3MB in the beginning and 144.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,479 INFO L158 Benchmark]: TraceAbstraction took 8161.40ms. Allocated memory was 211.8MB in the beginning and 325.1MB in the end (delta: 113.2MB). Free memory was 144.2MB in the beginning and 207.3MB in the end (delta: -63.1MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,480 INFO L158 Benchmark]: Witness Printer took 96.16ms. Allocated memory is still 325.1MB. Free memory was 207.3MB in the beginning and 202.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:01,481 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.16ms. Allocated memory is still 134.2MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.20ms. Allocated memory is still 211.8MB. Free memory was 182.9MB in the beginning and 167.4MB in the end (delta: 15.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.82ms. Allocated memory is still 211.8MB. Free memory was 167.4MB in the beginning and 165.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 211.8MB. Free memory was 165.4MB in the beginning and 163.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.96ms. Allocated memory is still 211.8MB. Free memory was 163.3MB in the beginning and 144.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8161.40ms. Allocated memory was 211.8MB in the beginning and 325.1MB in the end (delta: 113.2MB). Free memory was 144.2MB in the beginning and 207.3MB in the end (delta: -63.1MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. * Witness Printer took 96.16ms. Allocated memory is still 325.1MB. Free memory was 207.3MB in the beginning and 202.1MB 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: #t~short11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~short11 * 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: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: 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 1 procedures, 53 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 753 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 753 mSDsluCounter, 1515 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 972 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 543 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 511 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=20, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 151 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 615 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 2064 SizeOfPredicates, 11 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 316/459 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((((n <= 2147483647) && (1 <= length1)) && (length2 <= 2147483646)) && (1 <= length2)) && (0 <= (i + 2147483648))) && (length1 <= 2147483647)) && (1 <= n)) || (((i == 0) && (length2 == 1)) && (((((n <= length1) && (1 <= length1)) && (length1 <= 2147483647)) && (length1 <= ((long long) n + 2147483646))) || (((n <= 2147483647) && (length1 == 1)) && (1 <= n))))) - InvariantResult [Line: 521]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: ((((((((((long long) length2 + 1) <= length1) && (i == 0)) && (((n <= 2147483647) && (length1 <= ((long long) n + 2147483646))) || ((n <= 2147483647) && (length1 == 1)))) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= n)) || (((((((1 <= i) && (((n <= 2147483647) && (length1 <= ((long long) n + 2147483646))) || ((n <= 2147483647) && (length1 == 1)))) && (1 <= length1)) && (length2 <= 2147483646)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= n))) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 20:10:01,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE