./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:07:06,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:07:06,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:07:06,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:07:06,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:07:06,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:07:06,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:07:06,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:07:06,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:07:06,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:07:06,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:07:06,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:07:06,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:07:06,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:07:06,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:07:06,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:07:06,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:07:06,300 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:07:06,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:07:06,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:07:06,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:07:06,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:07:06,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:07:06,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:07:06,305 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:07:06,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:07:06,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:07:06,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:07:06,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:07:06,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:06,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:07:06,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:07:06,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:07:06,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:07:06,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:07:06,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:07:06,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:07:06,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:07:06,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:07:06,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-11-09 11:07:06,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:07:06,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:07:06,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:07:06,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:07:06,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:07:06,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 11:07:08,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:07:08,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:07:08,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-11-09 11:07:08,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31334b16/073fcbfb767b47cca9e7dc736851d420/FLAGee0353c1f [2024-11-09 11:07:08,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31334b16/073fcbfb767b47cca9e7dc736851d420 [2024-11-09 11:07:08,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:07:08,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:07:08,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:08,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:07:08,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:07:08,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8683c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08, skipping insertion in model container [2024-11-09 11:07:08,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:07:08,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:08,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:07:08,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:08,541 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:07:08,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08 WrapperNode [2024-11-09 11:07:08,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:08,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:08,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:07:08,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:07:08,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,597 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 206 [2024-11-09 11:07:08,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:08,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:07:08,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:07:08,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:07:08,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:07:08,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:07:08,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:07:08,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:07:08,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:07:08,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (1/1) ... [2024-11-09 11:07:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:08,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:08,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:07:08,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:07:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:07:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:07:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 11:07:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 11:07:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:07:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:07:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:07:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:07:08,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:07:08,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:07:09,172 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-09 11:07:09,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:07:09,185 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:07:09,186 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:07:09,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:09 BoogieIcfgContainer [2024-11-09 11:07:09,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:07:09,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:07:09,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:07:09,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:07:09,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:07:08" (1/3) ... [2024-11-09 11:07:09,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19824dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:09, skipping insertion in model container [2024-11-09 11:07:09,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:08" (2/3) ... [2024-11-09 11:07:09,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19824dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:09, skipping insertion in model container [2024-11-09 11:07:09,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:09" (3/3) ... [2024-11-09 11:07:09,195 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-11-09 11:07:09,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:07:09,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-09 11:07:09,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:07:09,268 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;@1bc29199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:07:09,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 11:07:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 117 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 11:07:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:07:09,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:09,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:09,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:09,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -751734800, now seen corresponding path program 1 times [2024-11-09 11:07:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:09,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817979733] [2024-11-09 11:07:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:09,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817979733] [2024-11-09 11:07:09,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817979733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:09,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:09,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117229844] [2024-11-09 11:07:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:09,497 INFO L87 Difference]: Start difference. First operand has 127 states, 99 states have (on average 1.6363636363636365) internal successors, (162), 117 states have internal predecessors, (162), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:09,687 INFO L93 Difference]: Finished difference Result 299 states and 447 transitions. [2024-11-09 11:07:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 11:07:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:09,699 INFO L225 Difference]: With dead ends: 299 [2024-11-09 11:07:09,699 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 11:07:09,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:09,704 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 85 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:09,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 464 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 11:07:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2024-11-09 11:07:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 123 states have internal predecessors, (164), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2024-11-09 11:07:09,744 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 9 [2024-11-09 11:07:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2024-11-09 11:07:09,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2024-11-09 11:07:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:09,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:09,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:09,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:07:09,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:09,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1977093616, now seen corresponding path program 1 times [2024-11-09 11:07:09,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:09,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837709780] [2024-11-09 11:07:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837709780] [2024-11-09 11:07:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837709780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:09,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:09,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253149843] [2024-11-09 11:07:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:09,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:09,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:09,810 INFO L87 Difference]: Start difference. First operand 133 states and 176 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:09,871 INFO L93 Difference]: Finished difference Result 249 states and 328 transitions. [2024-11-09 11:07:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 11:07:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:09,873 INFO L225 Difference]: With dead ends: 249 [2024-11-09 11:07:09,873 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 11:07:09,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:09,875 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:09,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 203 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 11:07:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-09 11:07:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 127 states have internal predecessors, (168), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2024-11-09 11:07:09,896 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 14 [2024-11-09 11:07:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:09,896 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2024-11-09 11:07:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2024-11-09 11:07:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:09,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:09,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:09,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:07:09,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1977204962, now seen corresponding path program 1 times [2024-11-09 11:07:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:09,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150298888] [2024-11-09 11:07:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:07:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150298888] [2024-11-09 11:07:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150298888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:09,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138325125] [2024-11-09 11:07:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:09,961 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:10,006 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2024-11-09 11:07:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:10,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 11:07:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:10,008 INFO L225 Difference]: With dead ends: 137 [2024-11-09 11:07:10,008 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 11:07:10,008 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-11-09 11:07:10,009 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:10,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 11:07:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 11:07:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 126 states have internal predecessors, (166), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2024-11-09 11:07:10,028 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 14 [2024-11-09 11:07:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:10,029 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2024-11-09 11:07:10,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2024-11-09 11:07:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:10,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:10,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:10,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:07:10,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:10,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1515883742, now seen corresponding path program 1 times [2024-11-09 11:07:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360798893] [2024-11-09 11:07:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360798893] [2024-11-09 11:07:10,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360798893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045439565] [2024-11-09 11:07:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:10,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:10,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:10,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:07:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:10,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:10,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:10,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:10,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045439565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:10,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:10,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224936846] [2024-11-09 11:07:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:10,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:10,230 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:10,296 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2024-11-09 11:07:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:07:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:10,298 INFO L225 Difference]: With dead ends: 169 [2024-11-09 11:07:10,298 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 11:07:10,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:10,304 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:10,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 215 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 11:07:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2024-11-09 11:07:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 133 states have internal predecessors, (173), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 185 transitions. [2024-11-09 11:07:10,325 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 185 transitions. Word has length 15 [2024-11-09 11:07:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:10,325 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 185 transitions. [2024-11-09 11:07:10,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 185 transitions. [2024-11-09 11:07:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:10,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:10,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:10,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:10,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:10,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1163811621, now seen corresponding path program 1 times [2024-11-09 11:07:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275932522] [2024-11-09 11:07:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275932522] [2024-11-09 11:07:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275932522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698417925] [2024-11-09 11:07:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:10,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:10,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:10,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:10,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:07:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:10,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:10,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:10,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698417925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 11:07:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478094607] [2024-11-09 11:07:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:10,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:10,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:10,704 INFO L87 Difference]: Start difference. First operand 143 states and 185 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:10,754 INFO L93 Difference]: Finished difference Result 149 states and 193 transitions. [2024-11-09 11:07:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:10,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:07:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:10,755 INFO L225 Difference]: With dead ends: 149 [2024-11-09 11:07:10,755 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 11:07:10,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:10,756 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:10,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 199 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 11:07:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-11-09 11:07:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.4) internal successors, (175), 135 states have internal predecessors, (175), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 187 transitions. [2024-11-09 11:07:10,762 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 187 transitions. Word has length 15 [2024-11-09 11:07:10,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:10,763 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 187 transitions. [2024-11-09 11:07:10,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 187 transitions. [2024-11-09 11:07:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:10,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:10,764 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:10,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:10,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:10,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:10,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1543980216, now seen corresponding path program 1 times [2024-11-09 11:07:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:10,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219256562] [2024-11-09 11:07:10,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219256562] [2024-11-09 11:07:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219256562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716757196] [2024-11-09 11:07:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:11,047 INFO L87 Difference]: Start difference. First operand 145 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:07:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,119 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2024-11-09 11:07:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 11:07:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,121 INFO L225 Difference]: With dead ends: 212 [2024-11-09 11:07:11,121 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 11:07:11,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:11,122 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 128 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 323 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 11:07:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 178. [2024-11-09 11:07:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.414012738853503) internal successors, (222), 167 states have internal predecessors, (222), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 234 transitions. [2024-11-09 11:07:11,129 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 234 transitions. Word has length 17 [2024-11-09 11:07:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,129 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 234 transitions. [2024-11-09 11:07:11,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:07:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 234 transitions. [2024-11-09 11:07:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:11,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,130 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:07:11,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:11,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1572607572, now seen corresponding path program 1 times [2024-11-09 11:07:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874713268] [2024-11-09 11:07:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874713268] [2024-11-09 11:07:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874713268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553929813] [2024-11-09 11:07:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:11,167 INFO L87 Difference]: Start difference. First operand 178 states and 234 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:07:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,226 INFO L93 Difference]: Finished difference Result 204 states and 266 transitions. [2024-11-09 11:07:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:11,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 11:07:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,227 INFO L225 Difference]: With dead ends: 204 [2024-11-09 11:07:11,227 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 11:07:11,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:11,228 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 320 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 11:07:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 181. [2024-11-09 11:07:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 170 states have internal predecessors, (223), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2024-11-09 11:07:11,236 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 17 [2024-11-09 11:07:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,236 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2024-11-09 11:07:11,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:07:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2024-11-09 11:07:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:11,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:07:11,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:11,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 772528522, now seen corresponding path program 1 times [2024-11-09 11:07:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858171171] [2024-11-09 11:07:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858171171] [2024-11-09 11:07:11,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858171171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89994149] [2024-11-09 11:07:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:11,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:11,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:07:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:11,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89994149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621397145] [2024-11-09 11:07:11,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:11,334 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,374 INFO L93 Difference]: Finished difference Result 197 states and 259 transitions. [2024-11-09 11:07:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:11,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 11:07:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,376 INFO L225 Difference]: With dead ends: 197 [2024-11-09 11:07:11,376 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 11:07:11,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:11,377 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 307 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 11:07:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2024-11-09 11:07:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 165 states have internal predecessors, (215), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2024-11-09 11:07:11,383 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 17 [2024-11-09 11:07:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,383 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2024-11-09 11:07:11,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2024-11-09 11:07:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:11,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,386 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:07:11,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:11,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:11,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1052210307, now seen corresponding path program 1 times [2024-11-09 11:07:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295214299] [2024-11-09 11:07:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:07:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295214299] [2024-11-09 11:07:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295214299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820488911] [2024-11-09 11:07:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:11,665 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,752 INFO L93 Difference]: Finished difference Result 194 states and 251 transitions. [2024-11-09 11:07:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 11:07:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,756 INFO L225 Difference]: With dead ends: 194 [2024-11-09 11:07:11,756 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 11:07:11,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:11,758 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 127 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 315 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 11:07:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2024-11-09 11:07:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 156 states have internal predecessors, (204), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 216 transitions. [2024-11-09 11:07:11,768 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 216 transitions. Word has length 24 [2024-11-09 11:07:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,769 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 216 transitions. [2024-11-09 11:07:11,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 216 transitions. [2024-11-09 11:07:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:11,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,770 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:07:11,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:11,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1023582951, now seen corresponding path program 1 times [2024-11-09 11:07:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388065120] [2024-11-09 11:07:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:07:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388065120] [2024-11-09 11:07:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388065120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424451228] [2024-11-09 11:07:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:11,845 INFO L87 Difference]: Start difference. First operand 167 states and 216 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,920 INFO L93 Difference]: Finished difference Result 185 states and 240 transitions. [2024-11-09 11:07:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-09 11:07:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,922 INFO L225 Difference]: With dead ends: 185 [2024-11-09 11:07:11,922 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:07:11,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:11,923 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 128 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 313 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:07:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2024-11-09 11:07:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 145 states have internal predecessors, (191), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2024-11-09 11:07:11,935 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 24 [2024-11-09 11:07:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,935 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2024-11-09 11:07:11,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2024-11-09 11:07:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:07:11,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:07:11,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:11,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1965337269, now seen corresponding path program 1 times [2024-11-09 11:07:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069562601] [2024-11-09 11:07:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 11:07:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069562601] [2024-11-09 11:07:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069562601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289512284] [2024-11-09 11:07:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:12,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:12,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:07:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:07:12,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:07:12,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289512284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:12,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-09 11:07:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14898699] [2024-11-09 11:07:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:12,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:12,302 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:12,341 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2024-11-09 11:07:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-09 11:07:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:12,342 INFO L225 Difference]: With dead ends: 156 [2024-11-09 11:07:12,342 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 11:07:12,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:12,343 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:12,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 11:07:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 11:07:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 144 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2024-11-09 11:07:12,352 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 42 [2024-11-09 11:07:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2024-11-09 11:07:12,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2024-11-09 11:07:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:07:12,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:12,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:12,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:07:12,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -795912980, now seen corresponding path program 1 times [2024-11-09 11:07:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735129445] [2024-11-09 11:07:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 11:07:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 11:07:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735129445] [2024-11-09 11:07:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735129445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954350957] [2024-11-09 11:07:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:12,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:07:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:07:12,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:12,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954350957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:13,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 11:07:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948245641] [2024-11-09 11:07:13,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:07:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:07:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:13,019 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,119 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-09 11:07:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:07:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 43 [2024-11-09 11:07:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,123 INFO L225 Difference]: With dead ends: 224 [2024-11-09 11:07:13,123 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 11:07:13,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:07:13,123 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 21 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1162 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 11:07:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2024-11-09 11:07:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 144 states have internal predecessors, (188), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 11:07:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2024-11-09 11:07:13,131 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 43 [2024-11-09 11:07:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,131 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2024-11-09 11:07:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 12 states have internal predecessors, (43), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2024-11-09 11:07:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:07:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,145 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-11-09 11:07:13,336 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,SelfDestructingSolverStorable11 [2024-11-09 11:07:13,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 672064347, now seen corresponding path program 1 times [2024-11-09 11:07:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64597666] [2024-11-09 11:07:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:07:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64597666] [2024-11-09 11:07:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64597666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038445952] [2024-11-09 11:07:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:13,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:13,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:07:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 11:07:13,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:13,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038445952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2024-11-09 11:07:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819892456] [2024-11-09 11:07:13,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:07:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:07:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:07:13,769 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:07:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,994 INFO L93 Difference]: Finished difference Result 291 states and 381 transitions. [2024-11-09 11:07:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 11:07:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2024-11-09 11:07:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,996 INFO L225 Difference]: With dead ends: 291 [2024-11-09 11:07:13,996 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 11:07:13,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:07:13,996 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 140 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1039 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 11:07:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 174. [2024-11-09 11:07:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 158 states have internal predecessors, (202), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 11:07:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 223 transitions. [2024-11-09 11:07:14,008 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 223 transitions. Word has length 47 [2024-11-09 11:07:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,008 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 223 transitions. [2024-11-09 11:07:14,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:07:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 223 transitions. [2024-11-09 11:07:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 11:07:14,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:14,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:07:14,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:14,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:14,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1764601029, now seen corresponding path program 1 times [2024-11-09 11:07:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710698713] [2024-11-09 11:07:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 11:07:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:07:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710698713] [2024-11-09 11:07:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710698713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 11:07:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597853334] [2024-11-09 11:07:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:07:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:07:14,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:14,446 INFO L87 Difference]: Start difference. First operand 174 states and 223 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,582 INFO L93 Difference]: Finished difference Result 238 states and 302 transitions. [2024-11-09 11:07:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:07:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-09 11:07:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,584 INFO L225 Difference]: With dead ends: 238 [2024-11-09 11:07:14,584 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 11:07:14,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:07:14,585 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 7 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 588 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 11:07:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-09 11:07:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 158 states have internal predecessors, (200), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 11:07:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2024-11-09 11:07:14,613 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 51 [2024-11-09 11:07:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,613 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2024-11-09 11:07:14,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2024-11-09 11:07:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:07:14,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:14,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:07:14,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash 224799020, now seen corresponding path program 2 times [2024-11-09 11:07:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187218239] [2024-11-09 11:07:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:07:14,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187218239] [2024-11-09 11:07:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187218239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:14,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683777203] [2024-11-09 11:07:14,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:07:14,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:14,929 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:14,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:07:14,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 11:07:14,978 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:07:14,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:07:14,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:07:15,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:15,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683777203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:15,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:15,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2024-11-09 11:07:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331018710] [2024-11-09 11:07:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:15,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:07:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:07:15,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:15,027 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:15,145 INFO L93 Difference]: Finished difference Result 313 states and 391 transitions. [2024-11-09 11:07:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:07:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-09 11:07:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:15,147 INFO L225 Difference]: With dead ends: 313 [2024-11-09 11:07:15,147 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 11:07:15,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:15,147 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:15,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 988 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 11:07:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 195. [2024-11-09 11:07:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.2873563218390804) internal successors, (224), 176 states have internal predecessors, (224), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (15), 14 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-09 11:07:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 248 transitions. [2024-11-09 11:07:15,157 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 248 transitions. Word has length 55 [2024-11-09 11:07:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 248 transitions. [2024-11-09 11:07:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 248 transitions. [2024-11-09 11:07:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 11:07:15,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:15,158 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:15,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:15,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:15,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:15,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1363548882, now seen corresponding path program 1 times [2024-11-09 11:07:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341849066] [2024-11-09 11:07:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:07:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341849066] [2024-11-09 11:07:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341849066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592221239] [2024-11-09 11:07:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:15,554 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:15,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:07:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 11:07:15,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:07:15,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592221239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 14 [2024-11-09 11:07:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803488656] [2024-11-09 11:07:15,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 11:07:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:15,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 11:07:15,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:15,744 INFO L87 Difference]: Start difference. First operand 195 states and 248 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:07:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:15,910 INFO L93 Difference]: Finished difference Result 336 states and 421 transitions. [2024-11-09 11:07:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 11:07:15,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-09 11:07:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:15,911 INFO L225 Difference]: With dead ends: 336 [2024-11-09 11:07:15,911 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 11:07:15,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:07:15,912 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 149 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:15,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 787 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 11:07:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2024-11-09 11:07:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 200 states have (on average 1.27) internal successors, (254), 201 states have internal predecessors, (254), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (18), 17 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 11:07:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 283 transitions. [2024-11-09 11:07:15,925 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 283 transitions. Word has length 55 [2024-11-09 11:07:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:15,925 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 283 transitions. [2024-11-09 11:07:15,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 11:07:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 283 transitions. [2024-11-09 11:07:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 11:07:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:15,927 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:15,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:07:16,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 11:07:16,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1196775849, now seen corresponding path program 1 times [2024-11-09 11:07:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376139541] [2024-11-09 11:07:16,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 11:07:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:07:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376139541] [2024-11-09 11:07:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376139541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214274228] [2024-11-09 11:07:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:16,177 INFO L87 Difference]: Start difference. First operand 223 states and 283 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,207 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2024-11-09 11:07:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-09 11:07:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,209 INFO L225 Difference]: With dead ends: 419 [2024-11-09 11:07:16,209 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 11:07:16,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:16,210 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 188 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 11:07:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 228. [2024-11-09 11:07:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 206 states have internal predecessors, (258), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (18), 17 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 11:07:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 287 transitions. [2024-11-09 11:07:16,222 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 287 transitions. Word has length 61 [2024-11-09 11:07:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,222 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 287 transitions. [2024-11-09 11:07:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 287 transitions. [2024-11-09 11:07:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:07:16,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:07:16,223 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 23947374, now seen corresponding path program 1 times [2024-11-09 11:07:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76397939] [2024-11-09 11:07:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:07:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76397939] [2024-11-09 11:07:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76397939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924433234] [2024-11-09 11:07:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:16,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:07:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 11:07:16,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:07:16,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:07:16,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924433234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:16,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:16,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2024-11-09 11:07:16,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799427642] [2024-11-09 11:07:16,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:07:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:07:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:07:16,576 INFO L87 Difference]: Start difference. First operand 228 states and 287 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,663 INFO L93 Difference]: Finished difference Result 321 states and 399 transitions. [2024-11-09 11:07:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:07:16,663 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2024-11-09 11:07:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,665 INFO L225 Difference]: With dead ends: 321 [2024-11-09 11:07:16,665 INFO L226 Difference]: Without dead ends: 280 [2024-11-09 11:07:16,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:16,666 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 124 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 885 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-09 11:07:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 240. [2024-11-09 11:07:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 217 states have internal predecessors, (273), 11 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (18), 18 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 11:07:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 302 transitions. [2024-11-09 11:07:16,678 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 302 transitions. Word has length 62 [2024-11-09 11:07:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 302 transitions. [2024-11-09 11:07:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 11:07:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 302 transitions. [2024-11-09 11:07:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 11:07:16,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:07:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 11:07:16,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:16,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1564400528, now seen corresponding path program 1 times [2024-11-09 11:07:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394578363] [2024-11-09 11:07:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:07:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394578363] [2024-11-09 11:07:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394578363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146817971] [2024-11-09 11:07:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:17,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:17,062 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:17,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 11:07:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:07:17,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:07:17,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146817971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:17,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:17,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-09 11:07:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809532042] [2024-11-09 11:07:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:17,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:17,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:17,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:07:17,304 INFO L87 Difference]: Start difference. First operand 240 states and 302 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:17,348 INFO L93 Difference]: Finished difference Result 240 states and 302 transitions. [2024-11-09 11:07:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:17,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2024-11-09 11:07:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:17,350 INFO L225 Difference]: With dead ends: 240 [2024-11-09 11:07:17,350 INFO L226 Difference]: Without dead ends: 239 [2024-11-09 11:07:17,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 11:07:17,351 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:17,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 278 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-09 11:07:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 214. [2024-11-09 11:07:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 193 states have internal predecessors, (245), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (17), 16 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 11:07:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2024-11-09 11:07:17,360 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 62 [2024-11-09 11:07:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:17,360 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2024-11-09 11:07:17,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 11:07:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2024-11-09 11:07:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 11:07:17,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:17,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:17,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 11:07:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:17,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1485901727, now seen corresponding path program 1 times [2024-11-09 11:07:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065570514] [2024-11-09 11:07:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:07:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065570514] [2024-11-09 11:07:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065570514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:17,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815135951] [2024-11-09 11:07:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:17,665 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:17,689 INFO L93 Difference]: Finished difference Result 214 states and 272 transitions. [2024-11-09 11:07:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:17,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-09 11:07:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:17,690 INFO L225 Difference]: With dead ends: 214 [2024-11-09 11:07:17,690 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 11:07:17,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:17,691 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:17,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 11:07:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-09 11:07:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 191 states have internal predecessors, (243), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (17), 16 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 11:07:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 270 transitions. [2024-11-09 11:07:17,700 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 270 transitions. Word has length 67 [2024-11-09 11:07:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:17,701 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 270 transitions. [2024-11-09 11:07:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2024-11-09 11:07:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 11:07:17,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:17,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:17,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:07:17,702 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:17,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1181686466, now seen corresponding path program 1 times [2024-11-09 11:07:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116085403] [2024-11-09 11:07:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:07:17,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116085403] [2024-11-09 11:07:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116085403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:07:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737447806] [2024-11-09 11:07:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 11:07:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 11:07:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:07:17,842 INFO L87 Difference]: Start difference. First operand 212 states and 270 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:18,006 INFO L93 Difference]: Finished difference Result 259 states and 328 transitions. [2024-11-09 11:07:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:07:18,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-09 11:07:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:18,007 INFO L225 Difference]: With dead ends: 259 [2024-11-09 11:07:18,007 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 11:07:18,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:07:18,008 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:18,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 609 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 11:07:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 225. [2024-11-09 11:07:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 202 states have internal predecessors, (256), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (19), 18 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-09 11:07:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2024-11-09 11:07:18,017 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 68 [2024-11-09 11:07:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2024-11-09 11:07:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2024-11-09 11:07:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 11:07:18,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:18,018 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:18,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 11:07:18,018 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:18,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2073068187, now seen corresponding path program 1 times [2024-11-09 11:07:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729654536] [2024-11-09 11:07:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 11:07:18,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:18,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729654536] [2024-11-09 11:07:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729654536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556232233] [2024-11-09 11:07:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:18,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:18,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:18,092 INFO L87 Difference]: Start difference. First operand 225 states and 287 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:18,123 INFO L93 Difference]: Finished difference Result 230 states and 292 transitions. [2024-11-09 11:07:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-09 11:07:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:18,126 INFO L225 Difference]: With dead ends: 230 [2024-11-09 11:07:18,126 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 11:07:18,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:18,127 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 165 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-11-09 11:07:18,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 11:07:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-09 11:07:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 204 states have (on average 1.2450980392156863) internal successors, (254), 201 states have internal predecessors, (254), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (19), 18 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-09 11:07:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2024-11-09 11:07:18,136 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 69 [2024-11-09 11:07:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:18,136 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2024-11-09 11:07:18,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:07:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2024-11-09 11:07:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 11:07:18,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:18,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:18,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 11:07:18,137 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-09 11:07:18,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:18,137 INFO L85 PathProgramCache]: Analyzing trace with hash 226721982, now seen corresponding path program 1 times [2024-11-09 11:07:18,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:18,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780409661] [2024-11-09 11:07:18,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:07:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:07:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 11:07:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:07:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:07:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780409661] [2024-11-09 11:07:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780409661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869251260] [2024-11-09 11:07:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:18,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:18,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 11:07:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:18,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 11:07:18,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 11:07:18,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 11:07:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869251260] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:07:18,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 8] total 13 [2024-11-09 11:07:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810600919] [2024-11-09 11:07:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:07:18,765 INFO L87 Difference]: Start difference. First operand 224 states and 285 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:18,794 INFO L93 Difference]: Finished difference Result 224 states and 285 transitions. [2024-11-09 11:07:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77 [2024-11-09 11:07:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:18,799 INFO L225 Difference]: With dead ends: 224 [2024-11-09 11:07:18,799 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:07:18,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:07:18,800 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:18,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 162 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:07:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:07:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:07:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:07:18,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-11-09 11:07:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:18,801 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:07:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 11:07:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:07:18,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:07:18,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-09 11:07:18,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-09 11:07:18,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-09 11:07:18,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:19,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 11:07:19,027 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:19,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:07:19,955 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:07:19,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:07:19 BoogieIcfgContainer [2024-11-09 11:07:19,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:07:19,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:07:19,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:07:19,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:07:19,977 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:09" (3/4) ... [2024-11-09 11:07:19,979 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:07:19,981 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-11-09 11:07:19,982 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:07:19,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-09 11:07:19,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 11:07:19,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:07:19,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:07:20,011 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-11-09 11:07:20,011 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2024-11-09 11:07:20,040 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2024-11-09 11:07:20,041 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-11-09 11:07:20,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:07:20,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:07:20,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:07:20,082 INFO L158 Benchmark]: Toolchain (without parser) took 11820.72ms. Allocated memory was 178.3MB in the beginning and 356.5MB in the end (delta: 178.3MB). Free memory was 111.1MB in the beginning and 281.2MB in the end (delta: -170.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,082 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 107.0MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:07:20,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.55ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 148.3MB in the end (delta: -37.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.26ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,083 INFO L158 Benchmark]: Boogie Preprocessor took 61.33ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 143.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,083 INFO L158 Benchmark]: RCFGBuilder took 525.18ms. Allocated memory is still 178.3MB. Free memory was 143.5MB in the beginning and 116.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,083 INFO L158 Benchmark]: TraceAbstraction took 10787.32ms. Allocated memory was 178.3MB in the beginning and 356.5MB in the end (delta: 178.3MB). Free memory was 116.2MB in the beginning and 288.5MB in the end (delta: -172.3MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,085 INFO L158 Benchmark]: Witness Printer took 105.45ms. Allocated memory is still 356.5MB. Free memory was 288.5MB in the beginning and 281.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 11:07:20,086 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.09ms. Allocated memory is still 107.0MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.55ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 148.3MB in the end (delta: -37.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.26ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.33ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 143.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.18ms. Allocated memory is still 178.3MB. Free memory was 143.5MB in the beginning and 116.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10787.32ms. Allocated memory was 178.3MB in the beginning and 356.5MB in the end (delta: 178.3MB). Free memory was 116.2MB in the beginning and 288.5MB in the end (delta: -172.3MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. * Witness Printer took 105.45ms. Allocated memory is still 356.5MB. Free memory was 288.5MB in the beginning and 281.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: 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 3 procedures, 127 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1340 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 10254 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7846 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1579 IncrementalHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 2408 mSDtfsCounter, 1579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 987 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=18, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 477 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1397 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 3086 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 38 InterpolantComputations, 20 PerfectInterpolantSequences, 468/526 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:07:20,114 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