./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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-3.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 bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:42:51,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:42:51,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:42:51,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:42:51,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:42:51,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:42:51,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:42:51,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:42:51,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:42:51,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:42:51,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:42:51,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:42:51,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:42:51,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:42:51,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:42:51,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:42:51,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:42:51,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:42:51,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:42:51,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:42:51,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:42:51,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:42:51,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:42:51,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:42:51,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:42:51,728 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:42:51,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:42:51,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:42:51,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:42:51,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:42:51,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:42:51,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:42:51,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:42:51,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:42:51,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:42:51,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:42:51,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:42:51,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:42:51,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:42:51,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:42:51,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:42:51,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:42:51,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:42:51,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:42:51,734 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 -> bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 [2024-11-12 16:42:51,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:42:52,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:42:52,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:42:52,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:42:52,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:42:52,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-12 16:42:53,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:42:53,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:42:53,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-12 16:42:53,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9a78975/b101da6f0a7643e69367d868ede9d29c/FLAGe72a3d5ab [2024-11-12 16:42:53,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9a78975/b101da6f0a7643e69367d868ede9d29c [2024-11-12 16:42:53,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:42:53,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:42:53,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:42:53,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:42:53,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:42:53,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:53" (1/1) ... [2024-11-12 16:42:53,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cec77bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:53, skipping insertion in model container [2024-11-12 16:42:53,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:42:53" (1/1) ... [2024-11-12 16:42:53,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:42:53,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:42:53,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:42:54,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:42:54,030 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:42:54,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54 WrapperNode [2024-11-12 16:42:54,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:42:54,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:42:54,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:42:54,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:42:54,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,066 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-12 16:42:54,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:42:54,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:42:54,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:42:54,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:42:54,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,096 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-12 16:42:54,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:42:54,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:42:54,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:42:54,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:42:54,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (1/1) ... [2024-11-12 16:42:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:42:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:54,149 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-12 16:42:54,154 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-12 16:42:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:42:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:42:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-12 16:42:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-12 16:42:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:42:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:42:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-12 16:42:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-12 16:42:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 16:42:54,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 16:42:54,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:42:54,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:42:54,749 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-12 16:42:54,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:42:54,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:42:54,768 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:42:54,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:54 BoogieIcfgContainer [2024-11-12 16:42:54,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:42:54,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:42:54,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:42:54,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:42:54,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:42:53" (1/3) ... [2024-11-12 16:42:54,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fba21a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:54, skipping insertion in model container [2024-11-12 16:42:54,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:42:54" (2/3) ... [2024-11-12 16:42:54,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fba21a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:42:54, skipping insertion in model container [2024-11-12 16:42:54,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:54" (3/3) ... [2024-11-12 16:42:54,778 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3.c.cil.c [2024-11-12 16:42:54,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:42:54,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-12 16:42:54,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:42:54,863 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;@1c84c9d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:42:54,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-12 16:42:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 108 states have internal predecessors, (139), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 16:42:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:42:54,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:54,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:54,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:54,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1043008487, now seen corresponding path program 1 times [2024-11-12 16:42:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:54,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434344880] [2024-11-12 16:42:54,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,142 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-12 16:42:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434344880] [2024-11-12 16:42:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434344880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616826230] [2024-11-12 16:42:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:55,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:55,173 INFO L87 Difference]: Start difference. First operand has 121 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 108 states have internal predecessors, (139), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:55,301 INFO L93 Difference]: Finished difference Result 293 states and 408 transitions. [2024-11-12 16:42:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:42:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:55,313 INFO L225 Difference]: With dead ends: 293 [2024-11-12 16:42:55,313 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 16:42:55,318 INFO L434 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-12 16:42:55,321 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:55,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 390 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 16:42:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-11-12 16:42:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 123 states have (on average 1.5040650406504066) internal successors, (185), 141 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2024-11-12 16:42:55,368 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 9 [2024-11-12 16:42:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:55,369 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2024-11-12 16:42:55,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2024-11-12 16:42:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:42:55,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:55,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:55,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:42:55,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:55,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash -821190777, now seen corresponding path program 1 times [2024-11-12 16:42:55,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:55,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174903360] [2024-11-12 16:42:55,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:55,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,443 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-12 16:42:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:55,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174903360] [2024-11-12 16:42:55,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174903360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:55,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463970154] [2024-11-12 16:42:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:55,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:55,452 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:55,538 INFO L93 Difference]: Finished difference Result 289 states and 376 transitions. [2024-11-12 16:42:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:42:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:55,541 INFO L225 Difference]: With dead ends: 289 [2024-11-12 16:42:55,541 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 16:42:55,545 INFO L434 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-12 16:42:55,546 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:55,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 16:42:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2024-11-12 16:42:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 127 states have (on average 1.4881889763779528) internal successors, (189), 145 states have internal predecessors, (189), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2024-11-12 16:42:55,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 14 [2024-11-12 16:42:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:55,577 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2024-11-12 16:42:55,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2024-11-12 16:42:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 16:42:55,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:55,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:55,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:42:55,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -821302123, now seen corresponding path program 1 times [2024-11-12 16:42:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942606586] [2024-11-12 16:42:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:42:55,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:55,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942606586] [2024-11-12 16:42:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942606586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:55,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:42:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951920863] [2024-11-12 16:42:55,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:55,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:55,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:55,657 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:55,719 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2024-11-12 16:42:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-12 16:42:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:55,722 INFO L225 Difference]: With dead ends: 157 [2024-11-12 16:42:55,722 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 16:42:55,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:55,726 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:55,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 16:42:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-12 16:42:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 144 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2024-11-12 16:42:55,751 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 14 [2024-11-12 16:42:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:55,752 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2024-11-12 16:42:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2024-11-12 16:42:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:42:55,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:55,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:55,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:42:55,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1305833913, now seen corresponding path program 1 times [2024-11-12 16:42:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:55,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648206954] [2024-11-12 16:42:55,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:55,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648206954] [2024-11-12 16:42:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648206954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739006973] [2024-11-12 16:42:55,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:55,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:55,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:42:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:55,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:55,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:55,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739006973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:55,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-12 16:42:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530681736] [2024-11-12 16:42:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:55,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:55,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:55,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:55,996 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:56,077 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2024-11-12 16:42:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:42:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:56,080 INFO L225 Difference]: With dead ends: 182 [2024-11-12 16:42:56,081 INFO L226 Difference]: Without dead ends: 180 [2024-11-12 16:42:56,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:56,082 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:56,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-12 16:42:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2024-11-12 16:42:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 151 states have internal predecessors, (194), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2024-11-12 16:42:56,096 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 15 [2024-11-12 16:42:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:56,097 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2024-11-12 16:42:56,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2024-11-12 16:42:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 16:42:56,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:56,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:56,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:42:56,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:56,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash 309438020, now seen corresponding path program 1 times [2024-11-12 16:42:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12767576] [2024-11-12 16:42:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12767576] [2024-11-12 16:42:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12767576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783971140] [2024-11-12 16:42:56,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:56,366 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:56,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:42:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:56,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:56,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783971140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:56,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 16:42:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703859990] [2024-11-12 16:42:56,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:56,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:56,443 INFO L87 Difference]: Start difference. First operand 163 states and 209 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:56,496 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2024-11-12 16:42:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:56,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 16:42:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:56,499 INFO L225 Difference]: With dead ends: 169 [2024-11-12 16:42:56,499 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 16:42:56,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:42:56,500 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:56,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 223 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:56,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 16:42:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-12 16:42:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 153 states have internal predecessors, (196), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 211 transitions. [2024-11-12 16:42:56,519 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 211 transitions. Word has length 15 [2024-11-12 16:42:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 211 transitions. [2024-11-12 16:42:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 211 transitions. [2024-11-12 16:42:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:56,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:56,521 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:56,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:42:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:56,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:56,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 443744229, now seen corresponding path program 1 times [2024-11-12 16:42:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122833126] [2024-11-12 16:42:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,801 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-12 16:42:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122833126] [2024-11-12 16:42:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122833126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:56,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143918750] [2024-11-12 16:42:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:56,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:56,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:56,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:56,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:56,806 INFO L87 Difference]: Start difference. First operand 165 states and 211 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:56,913 INFO L93 Difference]: Finished difference Result 234 states and 299 transitions. [2024-11-12 16:42:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 16:42:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:56,915 INFO L225 Difference]: With dead ends: 234 [2024-11-12 16:42:56,915 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 16:42:56,915 INFO L434 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-12 16:42:56,916 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 85 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:56,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 422 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 16:42:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 213. [2024-11-12 16:42:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 184 states have (on average 1.4293478260869565) internal successors, (263), 200 states have internal predecessors, (263), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2024-11-12 16:42:56,937 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 17 [2024-11-12 16:42:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2024-11-12 16:42:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2024-11-12 16:42:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:56,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:56,939 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:56,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:42:56,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:56,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash 415116873, now seen corresponding path program 1 times [2024-11-12 16:42:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211243299] [2024-11-12 16:42:56,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:56,998 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-12 16:42:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211243299] [2024-11-12 16:42:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211243299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:56,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996038059] [2024-11-12 16:42:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:57,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:57,001 INFO L87 Difference]: Start difference. First operand 213 states and 278 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:57,102 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2024-11-12 16:42:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:57,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-12 16:42:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:57,104 INFO L225 Difference]: With dead ends: 235 [2024-11-12 16:42:57,105 INFO L226 Difference]: Without dead ends: 232 [2024-11-12 16:42:57,106 INFO L434 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-12 16:42:57,106 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:57,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 422 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-12 16:42:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2024-11-12 16:42:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 198 states have internal predecessors, (256), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2024-11-12 16:42:57,120 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 17 [2024-11-12 16:42:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:57,133 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2024-11-12 16:42:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:42:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2024-11-12 16:42:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:42:57,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:57,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:57,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:42:57,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1730858885, now seen corresponding path program 1 times [2024-11-12 16:42:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897943293] [2024-11-12 16:42:57,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,177 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-12 16:42:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:57,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897943293] [2024-11-12 16:42:57,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897943293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:42:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777289094] [2024-11-12 16:42:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:57,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:42:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:42:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:42:57,179 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:57,256 INFO L93 Difference]: Finished difference Result 399 states and 510 transitions. [2024-11-12 16:42:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:42:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 16:42:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:57,258 INFO L225 Difference]: With dead ends: 399 [2024-11-12 16:42:57,258 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 16:42:57,259 INFO L434 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-12 16:42:57,260 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:57,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 16:42:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2024-11-12 16:42:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 199 states have internal predecessors, (252), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2024-11-12 16:42:57,277 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 16 [2024-11-12 16:42:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:57,278 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2024-11-12 16:42:57,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2024-11-12 16:42:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:57,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:57,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:57,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:42:57,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:57,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -773774157, now seen corresponding path program 1 times [2024-11-12 16:42:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325314624] [2024-11-12 16:42:57,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:42:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325314624] [2024-11-12 16:42:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325314624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:42:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045280033] [2024-11-12 16:42:57,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:57,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:42:57,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:42:57,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:42:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:42:57,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:42:57,412 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-12 16:42:57,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:42:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045280033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:57,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:42:57,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-12 16:42:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719553666] [2024-11-12 16:42:57,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:57,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:57,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:57,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:57,413 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:57,461 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2024-11-12 16:42:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 16:42:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:57,463 INFO L225 Difference]: With dead ends: 226 [2024-11-12 16:42:57,463 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 16:42:57,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:42:57,464 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:57,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 16:42:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2024-11-12 16:42:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.360655737704918) internal successors, (249), 198 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 264 transitions. [2024-11-12 16:42:57,473 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 264 transitions. Word has length 17 [2024-11-12 16:42:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:57,473 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 264 transitions. [2024-11-12 16:42:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:42:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 264 transitions. [2024-11-12 16:42:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 16:42:57,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:57,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:57,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 16:42:57,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:42:57,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:57,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -526502896, now seen corresponding path program 1 times [2024-11-12 16:42:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772550849] [2024-11-12 16:42:57,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,725 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-12 16:42:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772550849] [2024-11-12 16:42:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772550849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187818583] [2024-11-12 16:42:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:57,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:42:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:57,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:42:57,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:42:57,726 INFO L87 Difference]: Start difference. First operand 211 states and 264 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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-12 16:42:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:57,772 INFO L93 Difference]: Finished difference Result 372 states and 465 transitions. [2024-11-12 16:42:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:42:57,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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-12 16:42:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:57,774 INFO L225 Difference]: With dead ends: 372 [2024-11-12 16:42:57,775 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 16:42:57,775 INFO L434 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-12 16:42:57,776 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:57,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 357 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:42:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 16:42:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-12 16:42:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 153 states have internal predecessors, (191), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2024-11-12 16:42:57,784 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 17 [2024-11-12 16:42:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:57,785 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2024-11-12 16:42:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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-12 16:42:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2024-11-12 16:42:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:57,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:57,787 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:57,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:42:57,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1029296454, now seen corresponding path program 1 times [2024-11-12 16:42:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778658443] [2024-11-12 16:42:57,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:57,850 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-12 16:42:57,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:57,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778658443] [2024-11-12 16:42:57,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778658443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:57,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:57,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456987828] [2024-11-12 16:42:57,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:57,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:57,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:57,853 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:57,961 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2024-11-12 16:42:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 16:42:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:57,964 INFO L225 Difference]: With dead ends: 174 [2024-11-12 16:42:57,965 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 16:42:57,965 INFO L434 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-12 16:42:57,965 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:57,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 473 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 16:42:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2024-11-12 16:42:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 151 states have internal predecessors, (189), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2024-11-12 16:42:57,977 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 24 [2024-11-12 16:42:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:57,977 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2024-11-12 16:42:57,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2024-11-12 16:42:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:57,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:57,978 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:57,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:42:57,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1057923810, now seen corresponding path program 1 times [2024-11-12 16:42:57,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202573336] [2024-11-12 16:42:57,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 16:42:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:58,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 16:42:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:42:58,042 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-12 16:42:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:42:58,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202573336] [2024-11-12 16:42:58,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202573336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:42:58,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:42:58,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:42:58,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492447142] [2024-11-12 16:42:58,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:42:58,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:42:58,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:42:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:42:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:42:58,045 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:42:58,139 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2024-11-12 16:42:58,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:42:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-12 16:42:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:42:58,141 INFO L225 Difference]: With dead ends: 173 [2024-11-12 16:42:58,141 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 16:42:58,141 INFO L434 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-12 16:42:58,142 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:42:58,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:42:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 16:42:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153. [2024-11-12 16:42:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 140 states have internal predecessors, (176), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:42:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2024-11-12 16:42:58,151 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 24 [2024-11-12 16:42:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:42:58,152 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2024-11-12 16:42:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:42:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2024-11-12 16:42:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 16:42:58,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:42:58,153 INFO L218 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] [2024-11-12 16:42:58,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:42:58,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:42:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:42:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1477228313, now seen corresponding path program 1 times [2024-11-12 16:42:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:42:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448022644] [2024-11-12 16:42:58,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:42:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:42:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:42:58,163 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:42:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:42:58,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:42:58,190 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:42:58,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-12 16:42:58,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-12 16:42:58,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-12 16:42:58,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-12 16:42:58,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-12 16:42:58,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-12 16:42:58,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-12 16:42:58,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-12 16:42:58,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-12 16:42:58,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-12 16:42:58,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-12 16:42:58,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-12 16:42:58,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:42:58,201 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:42:58,225 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:42:58,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:42:58 BoogieIcfgContainer [2024-11-12 16:42:58,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:42:58,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:42:58,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:42:58,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:42:58,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:42:54" (3/4) ... [2024-11-12 16:42:58,234 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:42:58,235 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:42:58,236 INFO L158 Benchmark]: Toolchain (without parser) took 4590.13ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 113.7MB in the beginning and 98.9MB in the end (delta: 14.8MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,236 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 172.0MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:42:58,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.98ms. Allocated memory is still 172.0MB. Free memory was 113.2MB in the beginning and 97.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.95ms. Allocated memory is still 172.0MB. Free memory was 97.5MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,237 INFO L158 Benchmark]: Boogie Preprocessor took 44.69ms. Allocated memory is still 172.0MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,237 INFO L158 Benchmark]: RCFGBuilder took 656.76ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 93.8MB in the beginning and 202.8MB in the end (delta: -109.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,238 INFO L158 Benchmark]: TraceAbstraction took 3458.85ms. Allocated memory is still 232.8MB. Free memory was 201.7MB in the beginning and 98.9MB in the end (delta: 102.8MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2024-11-12 16:42:58,238 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 232.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:42:58,239 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 172.0MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.98ms. Allocated memory is still 172.0MB. Free memory was 113.2MB in the beginning and 97.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.95ms. Allocated memory is still 172.0MB. Free memory was 97.5MB in the beginning and 95.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.69ms. Allocated memory is still 172.0MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.76ms. Allocated memory was 172.0MB in the beginning and 232.8MB in the end (delta: 60.8MB). Free memory was 93.8MB in the beginning and 202.8MB in the end (delta: -109.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3458.85ms. Allocated memory is still 232.8MB. Free memory was 201.7MB in the beginning and 98.9MB in the end (delta: 102.8MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 232.8MB. Free memory is still 98.9MB. 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: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=0, eb=0] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L241] zero = base2flt(0, 0) [L242] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: 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, 121 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 4048 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2554 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1494 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=6, InterpolantAutomatonStates: 52, 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, 12 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 35/45 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-12 16:42:58,272 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-3.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 bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:43:00,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:43:00,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-12 16:43:00,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:43:00,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:43:00,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:43:00,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:43:00,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:43:00,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:43:00,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:43:00,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:43:00,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:43:00,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:43:00,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:43:00,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:43:00,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:43:00,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:43:00,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:43:00,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:43:00,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:43:00,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:43:00,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:43:00,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:43:00,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:43:00,609 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:43:00,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:43:00,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:43:00,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:43:00,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:43:00,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:43:00,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:43:00,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:43:00,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:43:00,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:43:00,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:43:00,613 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:43:00,613 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:43:00,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:43:00,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:43:00,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:43:00,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:43:00,615 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 -> bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 [2024-11-12 16:43:00,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:43:00,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:43:00,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:43:00,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:43:00,956 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:43:00,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-12 16:43:02,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:43:02,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:43:02,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-12 16:43:02,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08dfea39c/e5de6939201c45e185e457a0f84b7309/FLAG7ed34ca4c [2024-11-12 16:43:02,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08dfea39c/e5de6939201c45e185e457a0f84b7309 [2024-11-12 16:43:02,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:43:02,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:43:02,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:43:02,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:43:02,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:43:02,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:43:02" (1/1) ... [2024-11-12 16:43:02,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fec9550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:02, skipping insertion in model container [2024-11-12 16:43:02,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:43:02" (1/1) ... [2024-11-12 16:43:02,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:43:03,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:43:03,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:43:03,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:43:03,104 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:43:03,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03 WrapperNode [2024-11-12 16:43:03,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:43:03,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:43:03,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:43:03,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:43:03,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,150 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-12 16:43:03,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:43:03,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:43:03,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:43:03,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:43:03,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,186 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-12 16:43:03,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:43:03,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:43:03,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:43:03,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:43:03,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (1/1) ... [2024-11-12 16:43:03,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:43:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:43:03,251 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-12 16:43:03,254 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-12 16:43:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:43:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:43:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-12 16:43:03,309 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-12 16:43:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:43:03,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:43:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-12 16:43:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-12 16:43:03,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 16:43:03,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 16:43:03,405 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:43:03,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:43:03,784 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-12 16:43:03,784 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:43:03,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:43:03,805 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:43:03,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:03 BoogieIcfgContainer [2024-11-12 16:43:03,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:43:03,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:43:03,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:43:03,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:43:03,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:43:02" (1/3) ... [2024-11-12 16:43:03,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15402e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:43:03, skipping insertion in model container [2024-11-12 16:43:03,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:03" (2/3) ... [2024-11-12 16:43:03,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15402e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:43:03, skipping insertion in model container [2024-11-12 16:43:03,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:03" (3/3) ... [2024-11-12 16:43:03,815 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3.c.cil.c [2024-11-12 16:43:03,835 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:43:03,836 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-12 16:43:03,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:43:03,933 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;@3d927aa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:43:03,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-12 16:43:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 84 states have internal predecessors, (102), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 16:43:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:43:03,944 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:03,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:03,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -74325512, now seen corresponding path program 1 times [2024-11-12 16:43:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104436573] [2024-11-12 16:43:03,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:03,967 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-12 16:43:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:03,970 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-12 16:43:03,972 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-12 16:43:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:04,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 16:43:04,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:04,055 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-12 16:43:04,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:43:04,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:43:04,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104436573] [2024-11-12 16:43:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104436573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:43:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:43:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:43:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907264663] [2024-11-12 16:43:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:43:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 16:43:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:43:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 16:43:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 16:43:04,093 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 84 states have internal predecessors, (102), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:43:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:04,138 INFO L93 Difference]: Finished difference Result 181 states and 244 transitions. [2024-11-12 16:43:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 16:43:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:43:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:04,149 INFO L225 Difference]: With dead ends: 181 [2024-11-12 16:43:04,150 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 16:43:04,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 16:43:04,158 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:04,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:43:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 16:43:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 16:43:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 66 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:43:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-11-12 16:43:04,198 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 9 [2024-11-12 16:43:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:04,199 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-11-12 16:43:04,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:43:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-11-12 16:43:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 16:43:04,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:04,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:04,208 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 (2)] Ended with exit code 0 [2024-11-12 16:43:04,404 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-12 16:43:04,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash -75266778, now seen corresponding path program 1 times [2024-11-12 16:43:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893111370] [2024-11-12 16:43:04,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:04,406 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-12 16:43:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:04,410 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-12 16:43:04,425 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-12 16:43:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:04,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:43:04,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:04,507 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-12 16:43:04,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:43:04,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:43:04,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893111370] [2024-11-12 16:43:04,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893111370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:43:04,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:43:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:43:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242685025] [2024-11-12 16:43:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:43:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:43:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:43:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:43:04,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:43:04,514 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:43:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:04,603 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2024-11-12 16:43:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:43:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-12 16:43:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:04,605 INFO L225 Difference]: With dead ends: 156 [2024-11-12 16:43:04,605 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 16:43:04,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-12 16:43:04,607 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:04,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:43:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 16:43:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 16:43:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 70 states have internal predecessors, (81), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:43:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-12 16:43:04,625 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 9 [2024-11-12 16:43:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:04,626 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-12 16:43:04,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:43:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-12 16:43:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 16:43:04,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:04,628 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:04,633 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 (3)] Forceful destruction successful, exit code 0 [2024-11-12 16:43:04,829 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-12 16:43:04,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:04,830 INFO L85 PathProgramCache]: Analyzing trace with hash -221032394, now seen corresponding path program 1 times [2024-11-12 16:43:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404499675] [2024-11-12 16:43:04,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:04,831 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-12 16:43:04,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:04,834 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-12 16:43:04,835 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-12 16:43:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:04,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:43:04,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:04,880 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-12 16:43:04,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:43:04,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:43:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404499675] [2024-11-12 16:43:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404499675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:43:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:43:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:43:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214459756] [2024-11-12 16:43:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:43:04,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:43:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:43:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:43:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:43:04,883 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-12 16:43:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:04,935 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-12 16:43:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:43:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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 16 [2024-11-12 16:43:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:04,936 INFO L225 Difference]: With dead ends: 82 [2024-11-12 16:43:04,936 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 16:43:04,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-12 16:43:04,938 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:04,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:43:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 16:43:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 16:43:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 69 states have internal predecessors, (80), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:43:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-12 16:43:04,947 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 16 [2024-11-12 16:43:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:04,947 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-12 16:43:04,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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-12 16:43:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-12 16:43:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 16:43:04,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:04,948 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:04,951 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-12 16:43:05,149 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-12 16:43:05,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1071283234, now seen corresponding path program 1 times [2024-11-12 16:43:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:05,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697164660] [2024-11-12 16:43:05,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:05,151 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-12 16:43:05,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:05,153 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-12 16:43:05,154 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-12 16:43:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:05,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:43:05,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:05,221 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-12 16:43:05,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:43:05,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:43:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697164660] [2024-11-12 16:43:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697164660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:43:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:43:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:43:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995989086] [2024-11-12 16:43:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:43:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:43:05,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:43:05,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:43:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:43:05,227 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-12 16:43:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:05,267 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-12 16:43:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:43:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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 18 [2024-11-12 16:43:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:05,269 INFO L225 Difference]: With dead ends: 81 [2024-11-12 16:43:05,269 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 16:43:05,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-12 16:43:05,271 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:05,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:43:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 16:43:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 16:43:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 68 states have internal predecessors, (79), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:43:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-12 16:43:05,279 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 18 [2024-11-12 16:43:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-12 16:43:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (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-12 16:43:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-12 16:43:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 16:43:05,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:05,280 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:05,288 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 16:43:05,484 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-12 16:43:05,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:05,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1071215708, now seen corresponding path program 1 times [2024-11-12 16:43:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478531826] [2024-11-12 16:43:05,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:05,486 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-12 16:43:05,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:05,489 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-12 16:43:05,490 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-12 16:43:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:43:05,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:43:05,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:43:05,615 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-12 16:43:05,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:43:05,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:43:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478531826] [2024-11-12 16:43:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478531826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:43:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:43:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:43:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380299855] [2024-11-12 16:43:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:43:05,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:43:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:43:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:43:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:43:05,621 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12 16:43:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:43:05,948 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-11-12 16:43:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:43:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12 16:43:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:43:05,951 INFO L225 Difference]: With dead ends: 101 [2024-11-12 16:43:05,952 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 16:43:05,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-12 16:43:05,953 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 16:43:05,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 16:43:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 16:43:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-12 16:43:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.359375) internal successors, (87), 75 states have internal predecessors, (87), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 16:43:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2024-11-12 16:43:05,966 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 18 [2024-11-12 16:43:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:43:05,967 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2024-11-12 16:43:05,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 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-12 16:43:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2024-11-12 16:43:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 16:43:05,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:43:05,971 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:43:05,976 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 16:43:06,172 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-12 16:43:06,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-12 16:43:06,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:43:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash -980045403, now seen corresponding path program 1 times [2024-11-12 16:43:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:43:06,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637978107] [2024-11-12 16:43:06,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:43:06,173 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-12 16:43:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:43:06,175 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12 16:43:06,176 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 (7)] Waiting until timeout for monitored process [2024-11-12 16:43:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:43:06,212 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:43:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:43:06,245 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 16:43:06,245 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:43:06,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-12 16:43:06,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-12 16:43:06,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-12 16:43:06,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-12 16:43:06,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-12 16:43:06,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-12 16:43:06,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-12 16:43:06,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-12 16:43:06,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-12 16:43:06,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-12 16:43:06,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-12 16:43:06,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-12 16:43:06,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-12 16:43:06,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-12 16:43:06,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-12 16:43:06,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-12 16:43:06,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-12 16:43:06,255 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 (7)] Ended with exit code 0 [2024-11-12 16:43:06,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 16:43:06,455 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 16:43:06,480 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:43:06,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:43:06 BoogieIcfgContainer [2024-11-12 16:43:06,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:43:06,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:43:06,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:43:06,490 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:43:06,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:03" (3/4) ... [2024-11-12 16:43:06,491 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 16:43:06,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:43:06,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:43:06,580 INFO L158 Benchmark]: Toolchain (without parser) took 3871.22ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.9MB in the beginning and 54.6MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:43:06,581 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:43:06,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.70ms. Allocated memory is still 65.0MB. Free memory was 31.7MB in the beginning and 34.2MB in the end (delta: -2.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.70ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 32.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,581 INFO L158 Benchmark]: Boogie Preprocessor took 65.74ms. Allocated memory is still 65.0MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,581 INFO L158 Benchmark]: RCFGBuilder took 587.64ms. Allocated memory is still 65.0MB. Free memory was 30.1MB in the beginning and 27.8MB in the end (delta: 2.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,582 INFO L158 Benchmark]: TraceAbstraction took 2680.97ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 56.7MB in the end (delta: -29.5MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,582 INFO L158 Benchmark]: Witness Printer took 90.56ms. Allocated memory is still 79.7MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:43:06,585 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.19ms. Allocated memory is still 48.2MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.70ms. Allocated memory is still 65.0MB. Free memory was 31.7MB in the beginning and 34.2MB in the end (delta: -2.5MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.70ms. Allocated memory is still 65.0MB. Free memory was 34.2MB in the beginning and 32.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.74ms. Allocated memory is still 65.0MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 587.64ms. Allocated memory is still 65.0MB. Free memory was 30.1MB in the beginning and 27.8MB in the end (delta: 2.3MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2680.97ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 27.3MB in the beginning and 56.7MB in the end (delta: -29.5MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 90.56ms. Allocated memory is still 79.7MB. Free memory was 56.7MB in the beginning and 54.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: 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, 97 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 870 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 443 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 8 QuantifiedInterpolants, 110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-12 16:43:06,623 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)