./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:55:41,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:55:41,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:55:41,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:55:41,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:55:41,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:55:41,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:55:41,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:55:41,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:55:41,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:55:41,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:55:41,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:55:41,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:55:41,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:55:41,297 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:55:41,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:55:41,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:55:41,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:55:41,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:55:41,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:55:41,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:55:41,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:55:41,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:55:41,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:55:41,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:55:41,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:55:41,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:55:41,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:55:41,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:55:41,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:55:41,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:55:41,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:55:41,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:55:41,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:55:41,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:41,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:55:41,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:55:41,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:55:41,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:55:41,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:55:41,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:55:41,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:55:41,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:55:41,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:55:41,304 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-10-13 12:55:41,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:55:41,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:55:41,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:55:41,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:55:41,504 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:55:41,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-13 12:55:42,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:55:42,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:55:42,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-13 12:55:42,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec63e05bd/e78ceae18d4144b5bbf696609e16caf7/FLAG52f76d249 [2024-10-13 12:55:43,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec63e05bd/e78ceae18d4144b5bbf696609e16caf7 [2024-10-13 12:55:43,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:55:43,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:55:43,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:43,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:55:43,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:55:43,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c73e846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43, skipping insertion in model container [2024-10-13 12:55:43,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:55:43,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:43,469 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:55:43,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:43,514 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:55:43,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43 WrapperNode [2024-10-13 12:55:43,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:43,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:43,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:55:43,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:55:43,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,550 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 206 [2024-10-13 12:55:43,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:43,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:55:43,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:55:43,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:55:43,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,584 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-10-13 12:55:43,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:55:43,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:55:43,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:55:43,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:55:43,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (1/1) ... [2024-10-13 12:55:43,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:43,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:43,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:55:43,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:55:43,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:55:43,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:55:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-13 12:55:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-13 12:55:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:55:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:55:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:55:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:55:43,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:55:43,765 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:55:44,124 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-10-13 12:55:44,124 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:55:44,148 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:55:44,148 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:55:44,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:44 BoogieIcfgContainer [2024-10-13 12:55:44,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:55:44,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:55:44,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:55:44,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:55:44,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:55:43" (1/3) ... [2024-10-13 12:55:44,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7603e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:44, skipping insertion in model container [2024-10-13 12:55:44,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:43" (2/3) ... [2024-10-13 12:55:44,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7603e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:44, skipping insertion in model container [2024-10-13 12:55:44,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:44" (3/3) ... [2024-10-13 12:55:44,158 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-10-13 12:55:44,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:55:44,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-13 12:55:44,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:55:44,218 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;@7400439e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:55:44,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 12:55:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.684782608695652) internal successors, (155), 110 states have internal predecessors, (155), 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-10-13 12:55:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 12:55:44,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:44,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:44,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:44,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2026540582, now seen corresponding path program 1 times [2024-10-13 12:55:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157794585] [2024-10-13 12:55:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157794585] [2024-10-13 12:55:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157794585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821838673] [2024-10-13 12:55:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:44,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:44,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:44,447 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.684782608695652) internal successors, (155), 110 states have internal predecessors, (155), 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 12:55:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:44,563 INFO L93 Difference]: Finished difference Result 285 states and 433 transitions. [2024-10-13 12:55:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-10-13 12:55:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:44,573 INFO L225 Difference]: With dead ends: 285 [2024-10-13 12:55:44,573 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 12:55:44,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:44,578 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 82 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:44,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 432 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 12:55:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2024-10-13 12:55:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 120 states have internal predecessors, (161), 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-10-13 12:55:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2024-10-13 12:55:44,613 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 8 [2024-10-13 12:55:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:44,613 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2024-10-13 12:55:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 12:55:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2024-10-13 12:55:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:44,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:44,614 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:55:44,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 481281290, now seen corresponding path program 1 times [2024-10-13 12:55:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921031131] [2024-10-13 12:55:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:55:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921031131] [2024-10-13 12:55:44,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921031131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634293723] [2024-10-13 12:55:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:44,670 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:44,714 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2024-10-13 12:55:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 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 14 [2024-10-13 12:55:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:44,717 INFO L225 Difference]: With dead ends: 130 [2024-10-13 12:55:44,717 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 12:55:44,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:44,718 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:44,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 12:55:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-13 12:55:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 119 states have internal predecessors, (159), 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-10-13 12:55:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2024-10-13 12:55:44,734 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 14 [2024-10-13 12:55:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:44,734 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2024-10-13 12:55:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2024-10-13 12:55:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:55:44,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:44,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:44,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:55:44,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:44,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash -53833114, now seen corresponding path program 1 times [2024-10-13 12:55:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:44,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775096250] [2024-10-13 12:55:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:44,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775096250] [2024-10-13 12:55:44,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775096250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:44,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906038821] [2024-10-13 12:55:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:44,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:44,790 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 3 states, 3 states have (on average 4.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-10-13 12:55:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:44,839 INFO L93 Difference]: Finished difference Result 240 states and 318 transitions. [2024-10-13 12:55:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:44,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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 13 [2024-10-13 12:55:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:44,840 INFO L225 Difference]: With dead ends: 240 [2024-10-13 12:55:44,840 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 12:55:44,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:44,842 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:44,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 12:55:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-10-13 12:55:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 123 states have internal predecessors, (163), 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-10-13 12:55:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2024-10-13 12:55:44,851 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 13 [2024-10-13 12:55:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:44,852 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2024-10-13 12:55:44,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-10-13 12:55:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2024-10-13 12:55:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:44,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:44,853 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:44,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:55:44,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2063445515, now seen corresponding path program 1 times [2024-10-13 12:55:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281428540] [2024-10-13 12:55:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281428540] [2024-10-13 12:55:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281428540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272078058] [2024-10-13 12:55:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:44,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:44,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:44,928 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:55:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:45,029 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2024-10-13 12:55:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-13 12:55:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:45,032 INFO L225 Difference]: With dead ends: 190 [2024-10-13 12:55:45,032 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 12:55:45,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-13 12:55:45,033 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:45,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 308 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 12:55:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-10-13 12:55:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.4429530201342282) internal successors, (215), 159 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-10-13 12:55:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 227 transitions. [2024-10-13 12:55:45,064 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 227 transitions. Word has length 15 [2024-10-13 12:55:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:45,064 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 227 transitions. [2024-10-13 12:55:45,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:55:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 227 transitions. [2024-10-13 12:55:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:45,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:45,065 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:45,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:55:45,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2034818159, now seen corresponding path program 1 times [2024-10-13 12:55:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010612967] [2024-10-13 12:55:45,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010612967] [2024-10-13 12:55:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010612967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568561158] [2024-10-13 12:55:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:45,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:45,138 INFO L87 Difference]: Start difference. First operand 170 states and 227 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:55:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:45,215 INFO L93 Difference]: Finished difference Result 191 states and 252 transitions. [2024-10-13 12:55:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:45,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-13 12:55:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:45,216 INFO L225 Difference]: With dead ends: 191 [2024-10-13 12:55:45,217 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 12:55:45,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-13 12:55:45,218 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:45,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 303 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 12:55:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2024-10-13 12:55:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 160 states have internal predecessors, (213), 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-10-13 12:55:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 225 transitions. [2024-10-13 12:55:45,239 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 225 transitions. Word has length 15 [2024-10-13 12:55:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:45,240 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 225 transitions. [2024-10-13 12:55:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 12:55:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 225 transitions. [2024-10-13 12:55:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:45,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:45,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:55:45,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1668771708, now seen corresponding path program 1 times [2024-10-13 12:55:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442584076] [2024-10-13 12:55:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:45,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:45,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442584076] [2024-10-13 12:55:45,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442584076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582410985] [2024-10-13 12:55:45,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:45,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:45,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:45,301 INFO L87 Difference]: Start difference. First operand 171 states and 225 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-13 12:55:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:45,386 INFO L93 Difference]: Finished difference Result 321 states and 417 transitions. [2024-10-13 12:55:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-13 12:55:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:45,388 INFO L225 Difference]: With dead ends: 321 [2024-10-13 12:55:45,390 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 12:55:45,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:45,392 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 109 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:45,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 375 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 12:55:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2024-10-13 12:55:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3975155279503106) internal successors, (225), 170 states have internal predecessors, (225), 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-10-13 12:55:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-13 12:55:45,404 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 14 [2024-10-13 12:55:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:45,404 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-13 12:55:45,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-10-13 12:55:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-13 12:55:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 12:55:45,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:45,406 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:45,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:55:45,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1762414964, now seen corresponding path program 1 times [2024-10-13 12:55:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478254692] [2024-10-13 12:55:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:45,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478254692] [2024-10-13 12:55:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478254692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:45,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82288140] [2024-10-13 12:55:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:45,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:45,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 12:55:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:55:45,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:55:45,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82288140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:45,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:45,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 12:55:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798592353] [2024-10-13 12:55:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:45,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:45,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:45,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:45,564 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-10-13 12:55:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:45,618 INFO L93 Difference]: Finished difference Result 198 states and 264 transitions. [2024-10-13 12:55:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2024-10-13 12:55:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:45,620 INFO L225 Difference]: With dead ends: 198 [2024-10-13 12:55:45,620 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 12:55:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:45,621 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:45,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 295 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 12:55:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2024-10-13 12:55:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 165 states have internal predecessors, (218), 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-10-13 12:55:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2024-10-13 12:55:45,636 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 16 [2024-10-13 12:55:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:45,636 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2024-10-13 12:55:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-10-13 12:55:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2024-10-13 12:55:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:55:45,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:45,638 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:45,654 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-10-13 12:55:45,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:45,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 82214617, now seen corresponding path program 1 times [2024-10-13 12:55:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:45,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153853807] [2024-10-13 12:55:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:55:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153853807] [2024-10-13 12:55:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153853807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432169824] [2024-10-13 12:55:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:45,898 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 12:55:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:45,970 INFO L93 Difference]: Finished difference Result 201 states and 262 transitions. [2024-10-13 12:55:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:45,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-10-13 12:55:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:45,972 INFO L225 Difference]: With dead ends: 201 [2024-10-13 12:55:45,973 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 12:55:45,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:45,974 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 125 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:45,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 303 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 12:55:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2024-10-13 12:55:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 169 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-10-13 12:55:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 234 transitions. [2024-10-13 12:55:45,986 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 234 transitions. Word has length 21 [2024-10-13 12:55:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:45,987 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 234 transitions. [2024-10-13 12:55:45,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 12:55:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 234 transitions. [2024-10-13 12:55:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:55:45,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:45,991 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:45,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:55:45,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 53587261, now seen corresponding path program 1 times [2024-10-13 12:55:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:45,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382895818] [2024-10-13 12:55:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:45,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 12:55:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382895818] [2024-10-13 12:55:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382895818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:46,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537536458] [2024-10-13 12:55:46,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:46,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:46,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:46,044 INFO L87 Difference]: Start difference. First operand 180 states and 234 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 12:55:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:46,103 INFO L93 Difference]: Finished difference Result 197 states and 256 transitions. [2024-10-13 12:55:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:46,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-10-13 12:55:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:46,104 INFO L225 Difference]: With dead ends: 197 [2024-10-13 12:55:46,104 INFO L226 Difference]: Without dead ends: 195 [2024-10-13 12:55:46,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:46,105 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 126 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:46,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 299 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-13 12:55:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2024-10-13 12:55:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 162 states have internal predecessors, (214), 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-10-13 12:55:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 226 transitions. [2024-10-13 12:55:46,113 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 226 transitions. Word has length 21 [2024-10-13 12:55:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:46,114 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 226 transitions. [2024-10-13 12:55:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 12:55:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2024-10-13 12:55:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 12:55:46,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:46,115 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:46,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:55:46,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:46,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1055113140, now seen corresponding path program 1 times [2024-10-13 12:55:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:46,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083286550] [2024-10-13 12:55:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:55:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083286550] [2024-10-13 12:55:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083286550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731621561] [2024-10-13 12:55:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:46,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:46,150 INFO L87 Difference]: Start difference. First operand 173 states and 226 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:46,191 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2024-10-13 12:55:46,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:46,191 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, (2), 1 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 20 [2024-10-13 12:55:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:46,192 INFO L225 Difference]: With dead ends: 193 [2024-10-13 12:55:46,192 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 12:55:46,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:46,193 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:46,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 201 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 12:55:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2024-10-13 12:55:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 146 states have internal predecessors, (193), 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-10-13 12:55:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2024-10-13 12:55:46,203 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 20 [2024-10-13 12:55:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:46,203 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2024-10-13 12:55:46,203 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2024-10-13 12:55:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 12:55:46,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:46,204 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:46,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:55:46,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:46,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash -243417684, now seen corresponding path program 1 times [2024-10-13 12:55:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688259297] [2024-10-13 12:55:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 12:55:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688259297] [2024-10-13 12:55:46,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688259297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638752537] [2024-10-13 12:55:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:46,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:46,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:46,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:46,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 12:55:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:55:46,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:55:46,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638752537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:46,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-13 12:55:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099233870] [2024-10-13 12:55:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:46,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:46,447 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 12:55:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:46,485 INFO L93 Difference]: Finished difference Result 157 states and 205 transitions. [2024-10-13 12:55:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 38 [2024-10-13 12:55:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:46,486 INFO L225 Difference]: With dead ends: 157 [2024-10-13 12:55:46,486 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 12:55:46,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:46,486 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:46,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 364 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 12:55:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-13 12:55:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.3617021276595744) internal successors, (192), 145 states have internal predecessors, (192), 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-10-13 12:55:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 204 transitions. [2024-10-13 12:55:46,500 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 204 transitions. Word has length 38 [2024-10-13 12:55:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:46,501 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 204 transitions. [2024-10-13 12:55:46,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 12:55:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 204 transitions. [2024-10-13 12:55:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 12:55:46,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:46,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:46,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 12:55:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 12:55:46,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1043986603, now seen corresponding path program 1 times [2024-10-13 12:55:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684127699] [2024-10-13 12:55:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 12:55:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684127699] [2024-10-13 12:55:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684127699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467526837] [2024-10-13 12:55:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:46,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:46,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 12:55:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:46,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:55:46,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:46,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467526837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:47,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-13 12:55:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978415740] [2024-10-13 12:55:47,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:47,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:55:47,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:55:47,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:55:47,016 INFO L87 Difference]: Start difference. First operand 156 states and 204 transitions. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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-10-13 12:55:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:47,110 INFO L93 Difference]: Finished difference Result 222 states and 287 transitions. [2024-10-13 12:55:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:55:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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 39 [2024-10-13 12:55:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:47,114 INFO L225 Difference]: With dead ends: 222 [2024-10-13 12:55:47,114 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 12:55:47,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 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-10-13 12:55:47,115 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 11 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:47,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 942 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 12:55:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-10-13 12:55:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 145 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-10-13 12:55:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2024-10-13 12:55:47,123 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 39 [2024-10-13 12:55:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2024-10-13 12:55:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 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-10-13 12:55:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2024-10-13 12:55:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 12:55:47,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:47,125 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 12:55:47,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:47,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 102743386, now seen corresponding path program 1 times [2024-10-13 12:55:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977796909] [2024-10-13 12:55:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 12:55:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:47,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:47,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977796909] [2024-10-13 12:55:47,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977796909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628325052] [2024-10-13 12:55:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:47,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:47,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:47,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:55:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:47,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:55:47,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:47,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628325052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:47,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2024-10-13 12:55:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124729162] [2024-10-13 12:55:47,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 12:55:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 12:55:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:55:47,730 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-10-13 12:55:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:47,942 INFO L93 Difference]: Finished difference Result 287 states and 378 transitions. [2024-10-13 12:55:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 12:55:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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 43 [2024-10-13 12:55:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:47,943 INFO L225 Difference]: With dead ends: 287 [2024-10-13 12:55:47,944 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 12:55:47,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 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-10-13 12:55:47,945 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:47,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1143 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 12:55:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 173. [2024-10-13 12:55:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 157 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-10-13 12:55:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 223 transitions. [2024-10-13 12:55:47,955 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 223 transitions. Word has length 43 [2024-10-13 12:55:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:47,955 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 223 transitions. [2024-10-13 12:55:47,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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-10-13 12:55:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 223 transitions. [2024-10-13 12:55:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 12:55:47,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:47,956 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 12:55:47,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:48,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:48,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:48,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash -321382982, now seen corresponding path program 1 times [2024-10-13 12:55:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079603152] [2024-10-13 12:55:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 12:55:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079603152] [2024-10-13 12:55:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079603152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:48,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:48,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:55:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684858086] [2024-10-13 12:55:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:55:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:55:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:48,282 INFO L87 Difference]: Start difference. First operand 173 states and 223 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-10-13 12:55:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:48,329 INFO L93 Difference]: Finished difference Result 236 states and 301 transitions. [2024-10-13 12:55:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:55:48,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 47 [2024-10-13 12:55:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:48,331 INFO L225 Difference]: With dead ends: 236 [2024-10-13 12:55:48,331 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 12:55:48,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:55:48,332 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 7 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:48,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 572 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 12:55:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-13 12:55:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.3071895424836601) internal successors, (200), 157 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-10-13 12:55:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2024-10-13 12:55:48,339 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 47 [2024-10-13 12:55:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:48,339 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2024-10-13 12:55:48,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-10-13 12:55:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2024-10-13 12:55:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 12:55:48,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:48,340 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 12:55:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:55:48,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1635988393, now seen corresponding path program 2 times [2024-10-13 12:55:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614192733] [2024-10-13 12:55:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 12:55:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:55:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614192733] [2024-10-13 12:55:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614192733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099976719] [2024-10-13 12:55:48,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:55:48,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:48,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:48,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:55:48,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 12:55:48,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:55:48,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:55:48,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:55:48,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 12:55:48,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099976719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:48,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-13 12:55:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192628484] [2024-10-13 12:55:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:48,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:48,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:55:48,663 INFO L87 Difference]: Start difference. First operand 173 states and 221 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-10-13 12:55:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:48,705 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-10-13 12:55:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 51 [2024-10-13 12:55:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:48,707 INFO L225 Difference]: With dead ends: 173 [2024-10-13 12:55:48,707 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 12:55:48,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:55:48,708 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:48,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 344 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 12:55:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-13 12:55:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 156 states have internal predecessors, (199), 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-10-13 12:55:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2024-10-13 12:55:48,717 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 51 [2024-10-13 12:55:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:48,717 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2024-10-13 12:55:48,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-10-13 12:55:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2024-10-13 12:55:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 12:55:48,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:48,718 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 12:55:48,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:55:48,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 12:55:48,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:48,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1429635686, now seen corresponding path program 1 times [2024-10-13 12:55:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917104768] [2024-10-13 12:55:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 12:55:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 12:55:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:55:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917104768] [2024-10-13 12:55:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917104768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247002733] [2024-10-13 12:55:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:49,033 INFO L87 Difference]: Start difference. First operand 172 states and 220 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:55:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:49,052 INFO L93 Difference]: Finished difference Result 172 states and 220 transitions. [2024-10-13 12:55:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 63 [2024-10-13 12:55:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:49,054 INFO L225 Difference]: With dead ends: 172 [2024-10-13 12:55:49,054 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 12:55:49,054 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-10-13 12:55:49,055 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 16 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:49,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 154 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 12:55:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-13 12:55:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.2875816993464053) internal successors, (197), 154 states have internal predecessors, (197), 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-10-13 12:55:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2024-10-13 12:55:49,063 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 63 [2024-10-13 12:55:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2024-10-13 12:55:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:55:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2024-10-13 12:55:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:55:49,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:49,064 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 12:55:49,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 12:55:49,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1369033053, now seen corresponding path program 1 times [2024-10-13 12:55:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806895378] [2024-10-13 12:55:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 12:55:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 12:55:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:55:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:49,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806895378] [2024-10-13 12:55:49,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806895378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:49,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:49,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:55:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183510447] [2024-10-13 12:55:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:49,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:55:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:55:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:55:49,181 INFO L87 Difference]: Start difference. First operand 170 states and 218 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:55:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:49,279 INFO L93 Difference]: Finished difference Result 217 states and 276 transitions. [2024-10-13 12:55:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:55:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 64 [2024-10-13 12:55:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:49,281 INFO L225 Difference]: With dead ends: 217 [2024-10-13 12:55:49,281 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 12:55:49,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:49,282 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:49,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 572 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 12:55:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2024-10-13 12:55:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 165 states have internal predecessors, (210), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-13 12:55:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 235 transitions. [2024-10-13 12:55:49,289 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 235 transitions. Word has length 64 [2024-10-13 12:55:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:49,289 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 235 transitions. [2024-10-13 12:55:49,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:55:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 235 transitions. [2024-10-13 12:55:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 12:55:49,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:49,290 INFO L215 NwaCegarLoop]: trace histogram [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-10-13 12:55:49,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:55:49,291 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 560291286, now seen corresponding path program 1 times [2024-10-13 12:55:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516904152] [2024-10-13 12:55:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 12:55:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 12:55:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:55:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:49,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516904152] [2024-10-13 12:55:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516904152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:49,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070905510] [2024-10-13 12:55:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:49,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:49,375 INFO L87 Difference]: Start difference. First operand 183 states and 235 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-10-13 12:55:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:49,390 INFO L93 Difference]: Finished difference Result 188 states and 240 transitions. [2024-10-13 12:55:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:49,391 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 65 [2024-10-13 12:55:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:49,392 INFO L225 Difference]: With dead ends: 188 [2024-10-13 12:55:49,392 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 12:55:49,392 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-10-13 12:55:49,392 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:49,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 12:55:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-13 12:55:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-10-13 12:55:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2024-10-13 12:55:49,400 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 65 [2024-10-13 12:55:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:49,401 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2024-10-13 12:55:49,401 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-10-13 12:55:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2024-10-13 12:55:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 12:55:49,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:49,402 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 12:55:49,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 12:55:49,402 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:49,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1444081913, now seen corresponding path program 1 times [2024-10-13 12:55:49,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488959374] [2024-10-13 12:55:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 12:55:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 12:55:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 12:55:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 12:55:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488959374] [2024-10-13 12:55:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488959374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:49,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051606154] [2024-10-13 12:55:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:49,566 INFO L87 Difference]: Start difference. First operand 182 states and 233 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-10-13 12:55:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:49,583 INFO L93 Difference]: Finished difference Result 182 states and 233 transitions. [2024-10-13 12:55:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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 73 [2024-10-13 12:55:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:49,584 INFO L225 Difference]: With dead ends: 182 [2024-10-13 12:55:49,584 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:55:49,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:49,585 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:49,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 154 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:55:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:55:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:55:49,586 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-10-13 12:55:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:55:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-10-13 12:55:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:55:49,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:55:49,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-13 12:55:49,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-13 12:55:49,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-13 12:55:49,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-13 12:55:49,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-13 12:55:49,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-13 12:55:49,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-13 12:55:49,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-13 12:55:49,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-13 12:55:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 12:55:49,594 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:49,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:55:49,913 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:55:49,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:55:49 BoogieIcfgContainer [2024-10-13 12:55:49,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:55:49,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:55:49,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:55:49,931 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:55:49,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:44" (3/4) ... [2024-10-13 12:55:49,933 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:55:49,935 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-10-13 12:55:49,936 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 12:55:49,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-13 12:55:49,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-13 12:55:49,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:55:49,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 12:55:49,962 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-10-13 12:55:49,962 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)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-13 12:55:50,003 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)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-13 12:55:50,003 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) [2024-10-13 12:55:50,042 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:55:50,043 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:55:50,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:55:50,043 INFO L158 Benchmark]: Toolchain (without parser) took 6813.79ms. Allocated memory was 121.6MB in the beginning and 197.1MB in the end (delta: 75.5MB). Free memory was 73.7MB in the beginning and 164.0MB in the end (delta: -90.3MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,043 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:55:50,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 121.6MB. Free memory was 73.7MB in the beginning and 57.6MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.76ms. Allocated memory is still 121.6MB. Free memory was 57.6MB in the beginning and 55.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,044 INFO L158 Benchmark]: Boogie Preprocessor took 48.37ms. Allocated memory is still 121.6MB. Free memory was 55.2MB in the beginning and 52.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,044 INFO L158 Benchmark]: RCFGBuilder took 549.17ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 52.4MB in the beginning and 113.6MB in the end (delta: -61.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,045 INFO L158 Benchmark]: TraceAbstraction took 5780.21ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 57.2MB in the end (delta: 56.4MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,045 INFO L158 Benchmark]: Witness Printer took 112.07ms. Allocated memory is still 197.1MB. Free memory was 57.2MB in the beginning and 164.0MB in the end (delta: -106.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:55:50,046 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.10ms. Allocated memory is still 121.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.55ms. Allocated memory is still 121.6MB. Free memory was 73.7MB in the beginning and 57.6MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.76ms. Allocated memory is still 121.6MB. Free memory was 57.6MB in the beginning and 55.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.37ms. Allocated memory is still 121.6MB. Free memory was 55.2MB in the beginning and 52.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.17ms. Allocated memory was 121.6MB in the beginning and 163.6MB in the end (delta: 41.9MB). Free memory was 52.4MB in the beginning and 113.6MB in the end (delta: -61.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5780.21ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 57.2MB in the end (delta: 56.4MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 112.07ms. Allocated memory is still 197.1MB. Free memory was 57.2MB in the beginning and 164.0MB in the end (delta: -106.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 120 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 902 mSDsluCounter, 7306 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5431 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1266 IncrementalHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1875 mSDtfsCounter, 1266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=17, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 245 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 827 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 1689 SizeOfPredicates, 3 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 236/256 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 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) - 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-10-13 12:55:50,066 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