./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:20:32,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:20:32,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:20:32,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:20:32,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:20:32,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:20:32,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:20:32,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:20:32,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:20:32,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:20:32,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:20:32,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:20:32,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:20:32,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:20:32,296 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:20:32,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:20:32,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:20:32,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:20:32,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:20:32,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:20:32,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:20:32,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:20:32,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:20:32,299 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:20:32,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:20:32,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:20:32,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:20:32,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:20:32,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:20:32,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:20:32,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:20:32,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:32,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:20:32,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:20:32,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:20:32,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:20:32,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:20:32,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:20:32,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:20:32,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:20:32,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:20:32,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc [2024-10-14 20:20:32,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:20:32,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:20:32,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:20:32,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:20:32,564 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:20:32,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2024-10-14 20:20:33,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:20:34,142 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:20:34,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2024-10-14 20:20:34,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53313a45a/0b9ba0e49363465b816653945106c63a/FLAGb6377511e [2024-10-14 20:20:34,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53313a45a/0b9ba0e49363465b816653945106c63a [2024-10-14 20:20:34,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:20:34,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:20:34,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:34,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:20:34,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:20:34,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:34,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f9504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34, skipping insertion in model container [2024-10-14 20:20:34,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:34,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:20:34,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:34,876 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:20:34,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:34,951 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:20:34,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34 WrapperNode [2024-10-14 20:20:34,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:34,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:34,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:20:34,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:20:34,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:34,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:34,998 INFO L138 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 160 [2024-10-14 20:20:34,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:34,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:20:34,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:20:34,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:20:35,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,040 INFO L175 MemorySlicer]: Split 9 memory accesses to 1 slices as follows [9]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2024-10-14 20:20:35,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:20:35,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:20:35,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:20:35,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:20:35,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (1/1) ... [2024-10-14 20:20:35,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:35,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:20:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:20:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:20:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:20:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:20:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2024-10-14 20:20:35,140 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen [2024-10-14 20:20:35,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:20:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:20:35,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:20:35,222 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:20:35,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:20:35,457 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-10-14 20:20:35,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:20:35,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:20:35,481 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 20:20:35,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:35 BoogieIcfgContainer [2024-10-14 20:20:35,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:20:35,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:20:35,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:20:35,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:20:35,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:20:34" (1/3) ... [2024-10-14 20:20:35,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747d9bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:35, skipping insertion in model container [2024-10-14 20:20:35,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:34" (2/3) ... [2024-10-14 20:20:35,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747d9bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:35, skipping insertion in model container [2024-10-14 20:20:35,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:35" (3/3) ... [2024-10-14 20:20:35,487 INFO L112 eAbstractionObserver]: Analyzing ICFG strstr.i [2024-10-14 20:20:35,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:20:35,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-14 20:20:35,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:20:35,551 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;@79cb3bc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:20:35,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-14 20:20:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.744186046511628) internal successors, (75), 57 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 20:20:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 20:20:35,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:35,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 20:20:35,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:35,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 189256, now seen corresponding path program 1 times [2024-10-14 20:20:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191039920] [2024-10-14 20:20:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:35,749 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-14 20:20:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191039920] [2024-10-14 20:20:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191039920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:35,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:20:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063913335] [2024-10-14 20:20:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:20:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:20:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:20:35,778 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.744186046511628) internal successors, (75), 57 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-14 20:20:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:35,835 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2024-10-14 20:20:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:20:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-14 20:20:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:35,846 INFO L225 Difference]: With dead ends: 108 [2024-10-14 20:20:35,847 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 20:20:35,849 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-14 20:20:35,852 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:35,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 20:20:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 20:20:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 28 states have internal predecessors, (30), 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-14 20:20:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-10-14 20:20:35,876 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 3 [2024-10-14 20:20:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:35,876 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-10-14 20:20:35,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-14 20:20:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-10-14 20:20:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 20:20:35,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:35,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 20:20:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:20:35,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 5867001, now seen corresponding path program 1 times [2024-10-14 20:20:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126135060] [2024-10-14 20:20:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:35,909 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-14 20:20:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126135060] [2024-10-14 20:20:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126135060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:35,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:35,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:20:35,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457414168] [2024-10-14 20:20:35,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:35,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:20:35,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:20:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:20:35,912 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-14 20:20:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:35,930 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-10-14 20:20:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:20:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-14 20:20:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:35,932 INFO L225 Difference]: With dead ends: 29 [2024-10-14 20:20:35,933 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 20:20:35,933 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-14 20:20:35,934 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:35,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 20:20:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 20:20:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 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-14 20:20:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-14 20:20:35,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2024-10-14 20:20:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:35,939 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-14 20:20:35,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-14 20:20:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-14 20:20:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 20:20:35,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:35,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 20:20:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:20:35,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1343226815, now seen corresponding path program 1 times [2024-10-14 20:20:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:35,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035039573] [2024-10-14 20:20:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,007 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-14 20:20:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035039573] [2024-10-14 20:20:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035039573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:20:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362996243] [2024-10-14 20:20:36,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:36,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:20:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:20:36,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:20:36,009 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:36,035 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-14 20:20:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:20:36,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 20:20:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:36,037 INFO L225 Difference]: With dead ends: 34 [2024-10-14 20:20:36,037 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:20:36,037 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-14 20:20:36,038 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 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-14 20:20:36,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:20:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 20:20:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 31 states have internal predecessors, (34), 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-14 20:20:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-10-14 20:20:36,046 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 6 [2024-10-14 20:20:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:36,048 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-10-14 20:20:36,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-10-14 20:20:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:20:36,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:36,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:36,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:20:36,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash 585684652, now seen corresponding path program 1 times [2024-10-14 20:20:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:36,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580282866] [2024-10-14 20:20:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,151 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-14 20:20:36,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580282866] [2024-10-14 20:20:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580282866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:36,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:20:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187547022] [2024-10-14 20:20:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:20:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:20:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:20:36,154 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:36,182 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-14 20:20:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:20:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:20:36,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:36,183 INFO L225 Difference]: With dead ends: 32 [2024-10-14 20:20:36,183 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 20:20:36,183 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-14 20:20:36,184 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:36,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 20:20:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 20:20:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 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-14 20:20:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-10-14 20:20:36,192 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 10 [2024-10-14 20:20:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:36,192 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-10-14 20:20:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-10-14 20:20:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:20:36,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:36,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:36,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:20:36,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 976355124, now seen corresponding path program 1 times [2024-10-14 20:20:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139347508] [2024-10-14 20:20:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,235 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-14 20:20:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139347508] [2024-10-14 20:20:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139347508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:36,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:36,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:20:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894371631] [2024-10-14 20:20:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:20:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:20:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:20:36,238 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-14 20:20:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:36,254 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-10-14 20:20:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:20:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-14 20:20:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:36,255 INFO L225 Difference]: With dead ends: 30 [2024-10-14 20:20:36,255 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 20:20:36,256 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-14 20:20:36,257 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:36,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 20:20:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 20:20:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 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-14 20:20:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-14 20:20:36,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2024-10-14 20:20:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:36,261 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-14 20:20:36,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-14 20:20:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-14 20:20:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:20:36,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:36,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:20:36,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:20:36,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:36,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1565252267, now seen corresponding path program 1 times [2024-10-14 20:20:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206206868] [2024-10-14 20:20:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,372 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-14 20:20:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206206868] [2024-10-14 20:20:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206206868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371490309] [2024-10-14 20:20:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:36,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:36,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:36,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:20:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:20:36,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:36,497 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-14 20:20:36,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:20:36,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371490309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:36,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:20:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-14 20:20:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948471220] [2024-10-14 20:20:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:36,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:20:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:20:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:20:36,499 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:36,545 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-10-14 20:20:36,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:20:36,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 20:20:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:36,548 INFO L225 Difference]: With dead ends: 25 [2024-10-14 20:20:36,549 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 20:20:36,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-14 20:20:36,550 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:36,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 20:20:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 20:20:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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-14 20:20:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-14 20:20:36,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2024-10-14 20:20:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:36,557 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-14 20:20:36,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-14 20:20:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:20:36,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:36,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2024-10-14 20:20:36,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:20:36,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 20:20:36,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:36,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1278179945, now seen corresponding path program 1 times [2024-10-14 20:20:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686306120] [2024-10-14 20:20:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,850 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-14 20:20:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686306120] [2024-10-14 20:20:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686306120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362353628] [2024-10-14 20:20:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:36,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:36,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:20:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:36,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:20:36,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:37,002 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-14 20:20:37,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:20:37,103 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-14 20:20:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362353628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:20:37,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:20:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-14 20:20:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997748130] [2024-10-14 20:20:37,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:20:37,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:20:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:20:37,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:20:37,105 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-14 20:20:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:37,209 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-14 20:20:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:20:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 12 [2024-10-14 20:20:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:37,212 INFO L225 Difference]: With dead ends: 40 [2024-10-14 20:20:37,212 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 20:20:37,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:20:37,216 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:37,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 20:20:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 20:20:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.2222222222222223) 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-14 20:20:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-10-14 20:20:37,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2024-10-14 20:20:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-10-14 20:20:37,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-14 20:20:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-10-14 20:20:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:20:37,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:37,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:37,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:20:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 20:20:37,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:37,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1974409755, now seen corresponding path program 1 times [2024-10-14 20:20:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982328381] [2024-10-14 20:20:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:37,468 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-14 20:20:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982328381] [2024-10-14 20:20:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982328381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:20:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715549005] [2024-10-14 20:20:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:20:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:20:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:20:37,469 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-14 20:20:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:37,494 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-14 20:20:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:20:37,494 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-14 20:20:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:37,494 INFO L225 Difference]: With dead ends: 46 [2024-10-14 20:20:37,494 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 20:20:37,495 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-14 20:20:37,499 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 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-14 20:20:37,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:37,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 20:20:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 20:20:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 43 states have internal predecessors, (49), 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-14 20:20:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-14 20:20:37,503 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2024-10-14 20:20:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:37,504 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-14 20:20:37,504 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-14 20:20:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-14 20:20:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 20:20:37,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:37,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:37,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:20:37,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1372851417, now seen corresponding path program 1 times [2024-10-14 20:20:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976293183] [2024-10-14 20:20:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:37,564 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-14 20:20:37,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976293183] [2024-10-14 20:20:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976293183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981086401] [2024-10-14 20:20:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:37,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:37,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:37,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:37,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:20:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:37,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:20:37,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:37,714 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-14 20:20:37,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:20:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981086401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:37,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:20:37,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-14 20:20:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289851540] [2024-10-14 20:20:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:37,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:20:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:20:37,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:20:37,719 INFO L87 Difference]: Start difference. First operand 44 states and 49 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-14 20:20:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:37,747 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-14 20:20:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:20:37,747 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-14 20:20:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:37,748 INFO L225 Difference]: With dead ends: 44 [2024-10-14 20:20:37,748 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 20:20:37,748 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-14 20:20:37,748 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:37,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 20:20:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 20:20:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 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-14 20:20:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-14 20:20:37,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2024-10-14 20:20:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:37,752 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-14 20:20:37,752 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-14 20:20:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-14 20:20:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:20:37,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:37,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:37,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:20:37,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:37,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash -391278926, now seen corresponding path program 1 times [2024-10-14 20:20:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543126538] [2024-10-14 20:20:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:38,017 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-14 20:20:38,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543126538] [2024-10-14 20:20:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543126538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487142401] [2024-10-14 20:20:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:38,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:38,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:38,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:20:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:38,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:20:38,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:38,103 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-14 20:20:38,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:20:38,133 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-14 20:20:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487142401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:20:38,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:20:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-14 20:20:38,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453701280] [2024-10-14 20:20:38,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:20:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 20:20:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 20:20:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:20:38,135 INFO L87 Difference]: Start difference. First operand 43 states and 48 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-14 20:20:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:38,163 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-10-14 20:20:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:20:38,164 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-14 20:20:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:38,164 INFO L225 Difference]: With dead ends: 59 [2024-10-14 20:20:38,164 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 20:20:38,165 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-14 20:20:38,165 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:38,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 20:20:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 20:20:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.125) internal successors, (63), 57 states have internal predecessors, (63), 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-14 20:20:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-10-14 20:20:38,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 19 [2024-10-14 20:20:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:38,175 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-10-14 20:20:38,175 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-14 20:20:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-10-14 20:20:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 20:20:38,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:38,176 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1] [2024-10-14 20:20:38,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:20:38,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:38,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1559430931, now seen corresponding path program 2 times [2024-10-14 20:20:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:38,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312905965] [2024-10-14 20:20:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:38,609 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-14 20:20:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:38,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312905965] [2024-10-14 20:20:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312905965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250294702] [2024-10-14 20:20:38,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:20:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:38,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:38,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:38,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:20:38,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:20:38,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:20:38,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:20:38,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:38,777 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-14 20:20:38,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:20:38,825 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-14 20:20:38,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250294702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:20:38,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:20:38,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 15 [2024-10-14 20:20:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031594877] [2024-10-14 20:20:38,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:20:38,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 20:20:38,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:38,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 20:20:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:20:38,826 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 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-14 20:20:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:38,975 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-10-14 20:20:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:20:38,975 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 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-14 20:20:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:38,976 INFO L225 Difference]: With dead ends: 63 [2024-10-14 20:20:38,976 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 20:20:38,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:20:38,977 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:38,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 53 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 20:20:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2024-10-14 20:20:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-14 20:20:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-10-14 20:20:38,981 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 27 [2024-10-14 20:20:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:38,981 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-10-14 20:20:38,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 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-14 20:20:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-10-14 20:20:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:20:38,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:38,982 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:38,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:20:39,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 20:20:39,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-14 20:20:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 273759280, now seen corresponding path program 2 times [2024-10-14 20:20:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691512311] [2024-10-14 20:20:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:39,311 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-14 20:20:39,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691512311] [2024-10-14 20:20:39,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691512311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:20:39,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543276539] [2024-10-14 20:20:39,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:20:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:39,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:20:39,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 20:20:39,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 20:20:39,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:20:39,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:20:39,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:20:39,460 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-14 20:20:39,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:20:39,536 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-14 20:20:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543276539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:20:39,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:20:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 15 [2024-10-14 20:20:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786816979] [2024-10-14 20:20:39,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:20:39,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 20:20:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 20:20:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:20:39,537 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 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-14 20:20:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:39,775 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-10-14 20:20:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:20:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 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 34 [2024-10-14 20:20:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:39,776 INFO L225 Difference]: With dead ends: 42 [2024-10-14 20:20:39,776 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:20:39,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:20:39,777 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:39,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:20:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:20:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:20:39,778 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-14 20:20:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:20:39,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-10-14 20:20:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:39,778 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:20:39,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 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-14 20:20:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:20:39,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:20:39,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-10-14 20:20:39,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-10-14 20:20:39,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-10-14 20:20:39,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:20:39,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:20:39,988 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:39,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:20:40,120 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:20:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:20:40 BoogieIcfgContainer [2024-10-14 20:20:40,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:20:40,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:20:40,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:20:40,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:20:40,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:35" (3/4) ... [2024-10-14 20:20:40,135 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:20:40,138 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure strlen [2024-10-14 20:20:40,141 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-14 20:20:40,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:20:40,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:20:40,142 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:20:40,215 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:20:40,215 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:20:40,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:20:40,216 INFO L158 Benchmark]: Toolchain (without parser) took 5691.35ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 95.1MB in the beginning and 123.9MB in the end (delta: -28.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,216 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:20:40,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.70ms. Allocated memory is still 159.4MB. Free memory was 94.7MB in the beginning and 117.0MB in the end (delta: -22.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.57ms. Allocated memory is still 159.4MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,217 INFO L158 Benchmark]: Boogie Preprocessor took 57.75ms. Allocated memory is still 159.4MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,217 INFO L158 Benchmark]: RCFGBuilder took 423.85ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 91.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,217 INFO L158 Benchmark]: TraceAbstraction took 4650.04ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 90.2MB in the beginning and 130.2MB in the end (delta: -39.9MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,217 INFO L158 Benchmark]: Witness Printer took 82.69ms. Allocated memory is still 199.2MB. Free memory was 130.2MB in the beginning and 123.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:20:40,218 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.20ms. Allocated memory is still 98.6MB. Free memory is still 47.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.70ms. Allocated memory is still 159.4MB. Free memory was 94.7MB in the beginning and 117.0MB in the end (delta: -22.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.57ms. Allocated memory is still 159.4MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.75ms. Allocated memory is still 159.4MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.85ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 91.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4650.04ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 90.2MB in the beginning and 130.2MB in the end (delta: -39.9MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Witness Printer took 82.69ms. Allocated memory is still 199.2MB. Free memory was 130.2MB in the beginning and 123.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 544]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: 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: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 519]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 519]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 709 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 410 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 220 mSDtfsCounter, 410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 289 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 891 SizeOfPredicates, 4 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 176/346 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((out_len <= 2147483647) && (i == 0)) && (1 <= out_len)) || (((out_len <= 2147483647) && (1 <= i)) && (1 <= out_len))) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 510]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: ((((in_len <= 2147483647) && (1 <= i)) && (1 <= in_len)) || (((i == 0) && (in_len <= 2147483647)) && (1 <= in_len))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:20:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE