./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2.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 da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:34:01,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:34:01,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:34:01,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:34:01,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:34:01,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:34:01,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:34:01,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:34:01,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:34:01,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:34:01,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:34:01,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:34:01,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:34:01,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:34:01,974 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:34:01,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:34:01,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:34:01,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:34:01,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:34:01,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:34:01,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:34:01,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:34:01,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:34:01,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:34:01,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:34:01,977 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:34:01,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:34:01,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:34:01,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:34:01,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:34:01,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:34:01,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:34:01,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:34:01,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:34:01,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:01,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:34:01,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:34:01,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:34:01,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:34:01,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:34:01,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:34:01,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:34:01,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:34:01,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:34:01,981 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 -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-10 18:34:02,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:34:02,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:34:02,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:34:02,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:34:02,247 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:34:02,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-10 18:34:03,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:34:03,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:34:03,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-10 18:34:03,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9656da4/ac43325765be44e4a655ea207a77267f/FLAGa800db294 [2024-11-10 18:34:04,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9656da4/ac43325765be44e4a655ea207a77267f [2024-11-10 18:34:04,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:34:04,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:34:04,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:04,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:34:04,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:34:04,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6799c02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04, skipping insertion in model container [2024-11-10 18:34:04,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:34:04,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:04,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:34:04,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:04,520 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:34:04,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04 WrapperNode [2024-11-10 18:34:04,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:04,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:04,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:34:04,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:34:04,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,558 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2024-11-10 18:34:04,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:04,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:34:04,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:34:04,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:34:04,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,589 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:34:04,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:34:04,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:34:04,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:34:04,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:34:04,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2024-11-10 18:34:04,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:04,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:34:04,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:34:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:34:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:34:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-10 18:34:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-10 18:34:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:34:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:34:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-10 18:34:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-10 18:34:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:34:04,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:34:04,756 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:34:04,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:34:05,134 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2024-11-10 18:34:05,135 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:34:05,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:34:05,161 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 18:34:05,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:05 BoogieIcfgContainer [2024-11-10 18:34:05,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:34:05,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:34:05,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:34:05,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:34:05,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:34:04" (1/3) ... [2024-11-10 18:34:05,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7264c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:05, skipping insertion in model container [2024-11-10 18:34:05,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (2/3) ... [2024-11-10 18:34:05,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7264c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:05, skipping insertion in model container [2024-11-10 18:34:05,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:05" (3/3) ... [2024-11-10 18:34:05,172 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-10 18:34:05,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:34:05,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-10 18:34:05,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:34:05,256 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;@75ae8f29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:34:05,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-10 18:34:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 120 states have internal predecessors, (152), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:34:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:34:05,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:05,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:05,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:05,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1078038920, now seen corresponding path program 1 times [2024-11-10 18:34:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:05,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145325364] [2024-11-10 18:34:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:05,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145325364] [2024-11-10 18:34:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145325364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649356156] [2024-11-10 18:34:05,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:05,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:05,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:05,585 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 120 states have internal predecessors, (152), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:05,815 INFO L93 Difference]: Finished difference Result 326 states and 440 transitions. [2024-11-10 18:34:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-10 18:34:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:05,830 INFO L225 Difference]: With dead ends: 326 [2024-11-10 18:34:05,830 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 18:34:05,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:05,839 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 105 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:05,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 409 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 18:34:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 173. [2024-11-10 18:34:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 144 states have (on average 1.4305555555555556) internal successors, (206), 162 states have internal predecessors, (206), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 219 transitions. [2024-11-10 18:34:05,883 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 219 transitions. Word has length 10 [2024-11-10 18:34:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 219 transitions. [2024-11-10 18:34:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 219 transitions. [2024-11-10 18:34:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:05,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:05,885 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:05,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:34:05,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1624919599, now seen corresponding path program 1 times [2024-11-10 18:34:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416837375] [2024-11-10 18:34:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:05,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416837375] [2024-11-10 18:34:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416837375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673256893] [2024-11-10 18:34:05,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:05,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:05,970 INFO L87 Difference]: Start difference. First operand 173 states and 219 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-10 18:34:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,019 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2024-11-10 18:34:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2024-11-10 18:34:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,020 INFO L225 Difference]: With dead ends: 173 [2024-11-10 18:34:06,020 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 18:34:06,021 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-11-10 18:34:06,022 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 236 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 18:34:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-10 18:34:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 161 states have internal predecessors, (204), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2024-11-10 18:34:06,032 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 17 [2024-11-10 18:34:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2024-11-10 18:34:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-10 18:34:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2024-11-10 18:34:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:06,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:34:06,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1167099983, now seen corresponding path program 1 times [2024-11-10 18:34:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658587382] [2024-11-10 18:34:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658587382] [2024-11-10 18:34:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658587382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:06,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:06,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175665482] [2024-11-10 18:34:06,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:06,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:06,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:06,111 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,224 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2024-11-10 18:34:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:06,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 18 [2024-11-10 18:34:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,226 INFO L225 Difference]: With dead ends: 244 [2024-11-10 18:34:06,227 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 18:34:06,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:06,228 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 110 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 428 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 18:34:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2024-11-10 18:34:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.418848167539267) internal successors, (271), 207 states have internal predecessors, (271), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-11-10 18:34:06,241 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 18 [2024-11-10 18:34:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-11-10 18:34:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-11-10 18:34:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:06,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,242 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:34:06,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1121294273, now seen corresponding path program 1 times [2024-11-10 18:34:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535368033] [2024-11-10 18:34:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535368033] [2024-11-10 18:34:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535368033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054954041] [2024-11-10 18:34:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:06,335 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,457 INFO L93 Difference]: Finished difference Result 243 states and 307 transitions. [2024-11-10 18:34:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:06,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 18 [2024-11-10 18:34:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,459 INFO L225 Difference]: With dead ends: 243 [2024-11-10 18:34:06,460 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 18:34:06,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:06,462 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 426 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 18:34:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 225. [2024-11-10 18:34:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 198 states have (on average 1.378787878787879) internal successors, (273), 213 states have internal predecessors, (273), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2024-11-10 18:34:06,491 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 18 [2024-11-10 18:34:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2024-11-10 18:34:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2024-11-10 18:34:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:06,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:34:06,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 528704063, now seen corresponding path program 1 times [2024-11-10 18:34:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064924741] [2024-11-10 18:34:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064924741] [2024-11-10 18:34:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064924741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:06,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:06,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:06,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134004384] [2024-11-10 18:34:06,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:06,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:06,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:06,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:06,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:06,542 INFO L87 Difference]: Start difference. First operand 225 states and 286 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,592 INFO L93 Difference]: Finished difference Result 423 states and 536 transitions. [2024-11-10 18:34:06,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:06,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 18:34:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,593 INFO L225 Difference]: With dead ends: 423 [2024-11-10 18:34:06,593 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 18:34:06,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:06,598 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 241 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 18:34:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2024-11-10 18:34:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 203 states have (on average 1.354679802955665) internal successors, (275), 218 states have internal predecessors, (275), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 288 transitions. [2024-11-10 18:34:06,631 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 288 transitions. Word has length 17 [2024-11-10 18:34:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,632 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 288 transitions. [2024-11-10 18:34:06,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 288 transitions. [2024-11-10 18:34:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:06,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:34:06,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -789892306, now seen corresponding path program 1 times [2024-11-10 18:34:06,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742826879] [2024-11-10 18:34:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:06,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:06,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742826879] [2024-11-10 18:34:06,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742826879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:06,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:06,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:06,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735305754] [2024-11-10 18:34:06,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:06,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:06,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:06,723 INFO L87 Difference]: Start difference. First operand 230 states and 288 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,860 INFO L93 Difference]: Finished difference Result 434 states and 537 transitions. [2024-11-10 18:34:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:34:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 18 [2024-11-10 18:34:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,865 INFO L225 Difference]: With dead ends: 434 [2024-11-10 18:34:06,865 INFO L226 Difference]: Without dead ends: 263 [2024-11-10 18:34:06,866 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-11-10 18:34:06,867 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 372 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-10 18:34:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 244. [2024-11-10 18:34:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 232 states have internal predecessors, (291), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2024-11-10 18:34:06,882 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 18 [2024-11-10 18:34:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,882 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2024-11-10 18:34:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2024-11-10 18:34:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:06,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:34:06,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -249033176, now seen corresponding path program 1 times [2024-11-10 18:34:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727317662] [2024-11-10 18:34:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:06,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727317662] [2024-11-10 18:34:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727317662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317066393] [2024-11-10 18:34:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:06,920 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:06,963 INFO L93 Difference]: Finished difference Result 443 states and 551 transitions. [2024-11-10 18:34:06,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2024-11-10 18:34:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:06,965 INFO L225 Difference]: With dead ends: 443 [2024-11-10 18:34:06,965 INFO L226 Difference]: Without dead ends: 256 [2024-11-10 18:34:06,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:06,966 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:06,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-10 18:34:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2024-11-10 18:34:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 234 states have internal predecessors, (289), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 302 transitions. [2024-11-10 18:34:06,974 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 302 transitions. Word has length 18 [2024-11-10 18:34:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 302 transitions. [2024-11-10 18:34:06,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 302 transitions. [2024-11-10 18:34:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 18:34:06,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:06,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:06,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:34:06,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1066953108, now seen corresponding path program 1 times [2024-11-10 18:34:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507883785] [2024-11-10 18:34:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507883785] [2024-11-10 18:34:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507883785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433386142] [2024-11-10 18:34:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:07,024 INFO L87 Difference]: Start difference. First operand 246 states and 302 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,072 INFO L93 Difference]: Finished difference Result 419 states and 514 transitions. [2024-11-10 18:34:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:07,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2024-11-10 18:34:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,074 INFO L225 Difference]: With dead ends: 419 [2024-11-10 18:34:07,074 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 18:34:07,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:07,075 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 368 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 18:34:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-10 18:34:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 166 states have internal predecessors, (204), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 217 transitions. [2024-11-10 18:34:07,081 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 217 transitions. Word has length 19 [2024-11-10 18:34:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,081 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 217 transitions. [2024-11-10 18:34:07,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 217 transitions. [2024-11-10 18:34:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:07,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,082 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:34:07,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1866631846, now seen corresponding path program 1 times [2024-11-10 18:34:07,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239141664] [2024-11-10 18:34:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:34:07,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239141664] [2024-11-10 18:34:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239141664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167832435] [2024-11-10 18:34:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:07,141 INFO L87 Difference]: Start difference. First operand 178 states and 217 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,269 INFO L93 Difference]: Finished difference Result 195 states and 234 transitions. [2024-11-10 18:34:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 25 [2024-11-10 18:34:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,271 INFO L225 Difference]: With dead ends: 195 [2024-11-10 18:34:07,271 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 18:34:07,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:07,272 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 98 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 506 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 18:34:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2024-11-10 18:34:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 170 states have internal predecessors, (209), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 222 transitions. [2024-11-10 18:34:07,284 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 222 transitions. Word has length 25 [2024-11-10 18:34:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,285 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 222 transitions. [2024-11-10 18:34:07,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 222 transitions. [2024-11-10 18:34:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:07,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,286 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:34:07,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:07,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1912437556, now seen corresponding path program 1 times [2024-11-10 18:34:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728945611] [2024-11-10 18:34:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:34:07,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728945611] [2024-11-10 18:34:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728945611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054895753] [2024-11-10 18:34:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:07,369 INFO L87 Difference]: Start difference. First operand 182 states and 222 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,484 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2024-11-10 18:34:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:07,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 25 [2024-11-10 18:34:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,486 INFO L225 Difference]: With dead ends: 199 [2024-11-10 18:34:07,486 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 18:34:07,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:07,487 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 86 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 499 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 18:34:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2024-11-10 18:34:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 174 states have internal predecessors, (212), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-10 18:34:07,497 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 25 [2024-11-10 18:34:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,497 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-10 18:34:07,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-10 18:34:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:07,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,499 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:34:07,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:07,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1063031835, now seen corresponding path program 1 times [2024-11-10 18:34:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739636417] [2024-11-10 18:34:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739636417] [2024-11-10 18:34:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739636417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931886986] [2024-11-10 18:34:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:07,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:07,541 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:07,595 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2024-11-10 18:34:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:07,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-10 18:34:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:07,597 INFO L225 Difference]: With dead ends: 192 [2024-11-10 18:34:07,597 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 18:34:07,597 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-11-10 18:34:07,598 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:07,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 234 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 18:34:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2024-11-10 18:34:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 162 states have internal predecessors, (198), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2024-11-10 18:34:07,608 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 25 [2024-11-10 18:34:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:07,608 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2024-11-10 18:34:07,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2024-11-10 18:34:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 18:34:07,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:07,610 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:34:07,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:07,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1189562301, now seen corresponding path program 1 times [2024-11-10 18:34:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793500463] [2024-11-10 18:34:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:34:07,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:34:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:34:07,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:34:07,649 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:34:07,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-10 18:34:07,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-10 18:34:07,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-10 18:34:07,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-10 18:34:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:34:07,657 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:07,681 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:34:07,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:34:07 BoogieIcfgContainer [2024-11-10 18:34:07,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:34:07,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:34:07,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:34:07,685 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:34:07,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:05" (3/4) ... [2024-11-10 18:34:07,687 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:34:07,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:34:07,689 INFO L158 Benchmark]: Toolchain (without parser) took 3459.04ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 124.4MB in the beginning and 123.6MB in the end (delta: 805.3kB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-11-10 18:34:07,689 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:07,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.27ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 108.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 18:34:07,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.61ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:07,690 INFO L158 Benchmark]: Boogie Preprocessor took 39.55ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:07,690 INFO L158 Benchmark]: IcfgBuilder took 562.75ms. Allocated memory is still 161.5MB. Free memory was 104.4MB in the beginning and 78.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 18:34:07,691 INFO L158 Benchmark]: TraceAbstraction took 2519.68ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 78.2MB in the beginning and 124.6MB in the end (delta: -46.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:07,691 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 199.2MB. Free memory was 124.6MB in the beginning and 123.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:07,692 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.22ms. Allocated memory is still 115.3MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.27ms. Allocated memory is still 161.5MB. Free memory was 124.2MB in the beginning and 108.6MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.61ms. Allocated memory is still 161.5MB. Free memory was 108.6MB in the beginning and 106.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.55ms. Allocated memory is still 161.5MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 562.75ms. Allocated memory is still 161.5MB. Free memory was 104.4MB in the beginning and 78.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2519.68ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 78.2MB in the beginning and 124.6MB in the end (delta: -46.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 199.2MB. Free memory was 124.6MB in the beginning and 123.6MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; VAL [ea=0, eb=0] [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L80] m = m & ~ (1U << 24U) [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 132 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 715 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 701 mSDsluCounter, 3960 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2570 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 914 IncrementalHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1390 mSDtfsCounter, 914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=7, InterpolantAutomatonStates: 50, 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, 11 MinimizatonAttempts, 127 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 26/26 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:34:07,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:34:09,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:34:09,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-10 18:34:09,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:34:09,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:34:09,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:34:09,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:34:09,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:34:09,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:34:09,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:34:09,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:34:09,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:34:09,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:34:09,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:34:09,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:34:09,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:34:09,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:34:09,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:34:09,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:34:09,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:34:09,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:34:09,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:34:09,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:34:09,800 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:34:09,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:34:09,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:34:09,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:34:09,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:34:09,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:34:09,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:34:09,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:34:09,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:09,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:34:09,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:34:09,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:34:09,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:34:09,813 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:34:09,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:34:09,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:34:09,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:34:09,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:34:09,814 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 -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2024-11-10 18:34:10,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:34:10,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:34:10,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:34:10,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:34:10,125 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:34:10,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-10 18:34:11,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:34:11,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:34:11,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2024-11-10 18:34:11,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91422c29/c8d340c922c54399abe5616acb1ac959/FLAGd536d915a [2024-11-10 18:34:11,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91422c29/c8d340c922c54399abe5616acb1ac959 [2024-11-10 18:34:11,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:34:11,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:34:11,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:11,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:34:11,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:34:11,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24cb204d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11, skipping insertion in model container [2024-11-10 18:34:11,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:34:11,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:11,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:34:11,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:11,942 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:34:11,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11 WrapperNode [2024-11-10 18:34:11,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:11,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:11,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:34:11,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:34:11,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,978 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-10 18:34:11,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:11,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:34:11,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:34:11,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:34:11,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:11,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:34:12,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:34:12,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:34:12,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:34:12,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:34:12,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (1/1) ... [2024-11-10 18:34:12,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:12,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:12,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:34:12,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-10 18:34:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:34:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-10 18:34:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-10 18:34:12,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:34:12,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:34:12,174 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:34:12,176 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:34:12,501 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-10 18:34:12,501 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:34:12,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:34:12,520 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:34:12,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:12 BoogieIcfgContainer [2024-11-10 18:34:12,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:34:12,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:34:12,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:34:12,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:34:12,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:34:11" (1/3) ... [2024-11-10 18:34:12,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a649eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:12, skipping insertion in model container [2024-11-10 18:34:12,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:11" (2/3) ... [2024-11-10 18:34:12,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a649eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:12, skipping insertion in model container [2024-11-10 18:34:12,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:12" (3/3) ... [2024-11-10 18:34:12,531 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2024-11-10 18:34:12,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:34:12,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-10 18:34:12,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:34:12,610 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;@706533dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:34:12,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-10 18:34:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 97 states have internal predecessors, (116), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 18:34:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:34:12,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:12,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:12,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1448196087, now seen corresponding path program 1 times [2024-11-10 18:34:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:34:12,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609348437] [2024-11-10 18:34:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:12,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:34:12,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:34:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:34:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:34:12,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:12,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:12,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:34:12,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609348437] [2024-11-10 18:34:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609348437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674077119] [2024-11-10 18:34:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:12,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:12,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:34:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:12,785 INFO L87 Difference]: Start difference. First operand has 109 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 97 states have internal predecessors, (116), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:12,871 INFO L93 Difference]: Finished difference Result 210 states and 272 transitions. [2024-11-10 18:34:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-10 18:34:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:12,882 INFO L225 Difference]: With dead ends: 210 [2024-11-10 18:34:12,883 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 18:34:12,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:12,891 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:12,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 326 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 18:34:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 18:34:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 83 states have internal predecessors, (94), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-10 18:34:12,937 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 10 [2024-11-10 18:34:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-10 18:34:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-10 18:34:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:12,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:12,940 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:12,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 815733494, now seen corresponding path program 1 times [2024-11-10 18:34:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:34:13,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926305789] [2024-11-10 18:34:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:34:13,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:34:13,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:34:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:34:13,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:13,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:13,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:34:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926305789] [2024-11-10 18:34:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926305789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953943462] [2024-11-10 18:34:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:34:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:13,202 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-10 18:34:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:13,237 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2024-11-10 18:34:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2024-11-10 18:34:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:13,240 INFO L225 Difference]: With dead ends: 94 [2024-11-10 18:34:13,240 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 18:34:13,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:13,241 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:13,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 18:34:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 18:34:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 82 states have internal predecessors, (93), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2024-11-10 18:34:13,256 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 17 [2024-11-10 18:34:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:13,256 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2024-11-10 18:34:13,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-11-10 18:34:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2024-11-10 18:34:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 18:34:13,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:13,257 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:13,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:34:13,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:13,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -639150793, now seen corresponding path program 1 times [2024-11-10 18:34:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:34:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79003357] [2024-11-10 18:34:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:13,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:34:13,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:34:13,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:34:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:34:13,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:13,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:13,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:34:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79003357] [2024-11-10 18:34:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79003357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320260471] [2024-11-10 18:34:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:34:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:13,514 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-11-10 18:34:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:13,550 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-10 18:34:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 19 [2024-11-10 18:34:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:13,551 INFO L225 Difference]: With dead ends: 93 [2024-11-10 18:34:13,551 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 18:34:13,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:13,552 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:13,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 18:34:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 18:34:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 81 states have internal predecessors, (92), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-11-10 18:34:13,559 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 19 [2024-11-10 18:34:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:13,559 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-11-10 18:34:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-11-10 18:34:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-11-10 18:34:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 18:34:13,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:13,560 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-11-10 18:34:13,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:34:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:13,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1661824252, now seen corresponding path program 1 times [2024-11-10 18:34:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:34:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531531440] [2024-11-10 18:34:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:13,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:13,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:34:13,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:34:13,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:34:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:34:13,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:13,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:13,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:34:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531531440] [2024-11-10 18:34:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531531440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:13,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:13,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:13,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629798103] [2024-11-10 18:34:13,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:13,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:13,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:34:13,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:13,877 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:14,223 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2024-11-10 18:34:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2024-11-10 18:34:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:14,226 INFO L225 Difference]: With dead ends: 119 [2024-11-10 18:34:14,226 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 18:34:14,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:14,227 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:14,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 210 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:34:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 18:34:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-10 18:34:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 90 states have internal predecessors, (102), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 18:34:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2024-11-10 18:34:14,235 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 20 [2024-11-10 18:34:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:14,235 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2024-11-10 18:34:14,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2024-11-10 18:34:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 18:34:14,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:14,236 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:14,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:34:14,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:14,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-10 18:34:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -681753558, now seen corresponding path program 1 times [2024-11-10 18:34:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:34:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708850301] [2024-11-10 18:34:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:34:14,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:34:14,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:34:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:34:14,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:34:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:34:14,499 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:34:14,499 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:34:14,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-10 18:34:14,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-10 18:34:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-10 18:34:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-10 18:34:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-10 18:34:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-10 18:34:14,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-10 18:34:14,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-10 18:34:14,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-10 18:34:14,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-10 18:34:14,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-10 18:34:14,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 18:34:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:34:14,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 18:34:14,742 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:34:14,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:34:14 BoogieIcfgContainer [2024-11-10 18:34:14,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:34:14,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:34:14,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:34:14,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:34:14,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:12" (3/4) ... [2024-11-10 18:34:14,767 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:34:14,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:34:14,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:34:14,818 INFO L158 Benchmark]: Toolchain (without parser) took 3171.38ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 37.1MB in the beginning and 60.4MB in the end (delta: -23.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:14,818 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 28.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:14,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.92ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.6MB in the end (delta: 343.5kB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-10 18:34:14,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.83ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:14,819 INFO L158 Benchmark]: Boogie Preprocessor took 46.29ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 32.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:14,819 INFO L158 Benchmark]: IcfgBuilder took 493.93ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 39.4MB in the end (delta: -6.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-10 18:34:14,819 INFO L158 Benchmark]: TraceAbstraction took 2221.29ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 39.0MB in the beginning and 63.1MB in the end (delta: -24.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-10 18:34:14,819 INFO L158 Benchmark]: Witness Printer took 51.66ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:14,820 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 28.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.92ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.6MB in the end (delta: 343.5kB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.83ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.29ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 32.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 493.93ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 39.4MB in the end (delta: -6.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2221.29ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 39.0MB in the beginning and 63.1MB in the end (delta: -24.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 51.66ms. Allocated memory is still 86.0MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). There was no memory consumed. 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 - CounterExampleResult [Line: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L84] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L245] RET, EXPR base2flt(0, 0) [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 109 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 893 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 503 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 390 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 10 QuantifiedInterpolants, 115 SizeOfPredicates, 2 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6/6 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 18:34:14,847 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)