./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:34:04,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:34:04,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:34:04,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:34:04,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:34:04,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:34:04,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:34:04,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:34:04,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:34:04,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:34:04,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:34:04,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:34:04,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:34:04,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:34:04,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:34:04,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:34:04,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:34:04,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:34:04,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:34:04,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:34:04,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:34:04,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:34:04,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:34:04,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:34:04,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:34:04,997 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:34:04,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:34:04,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:34:04,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:34:04,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:34:04,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:34:04,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:34:04,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:34:04,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:34:04,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:04,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:34:05,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:34:05,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:34:05,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:34:05,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:34:05,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:34:05,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:34:05,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:34:05,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:34:05,002 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-10 18:34:05,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:34:05,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:34:05,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:34:05,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:34:05,308 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:34:05,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-10 18:34:06,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:34:06,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:34:06,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-10 18:34:06,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd87322ec/3ec117ff39a748449bb9eb23094d3c24/FLAG046f45edf [2024-11-10 18:34:07,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd87322ec/3ec117ff39a748449bb9eb23094d3c24 [2024-11-10 18:34:07,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:34:07,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:34:07,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:07,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:34:07,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:34:07,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8574d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07, skipping insertion in model container [2024-11-10 18:34:07,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:34:07,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:07,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:34:07,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:34:07,706 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:34:07,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07 WrapperNode [2024-11-10 18:34:07,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:34:07,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:07,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:34:07,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:34:07,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,740 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-10 18:34:07,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:34:07,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:34:07,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:34:07,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:34:07,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 18:34:07,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:34:07,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:34:07,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:34:07,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:34:07,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (1/1) ... [2024-11-10 18:34:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:34:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:07,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:34:07,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:34:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:34:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:34:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-10 18:34:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-10 18:34:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:34:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:34:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-10 18:34:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-10 18:34:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:34:07,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:34:07,932 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:34:07,934 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:34:08,296 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-10 18:34:08,296 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:34:08,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:34:08,338 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 18:34:08,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:08 BoogieIcfgContainer [2024-11-10 18:34:08,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:34:08,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:34:08,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:34:08,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:34:08,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:34:07" (1/3) ... [2024-11-10 18:34:08,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70718e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:08, skipping insertion in model container [2024-11-10 18:34:08,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:07" (2/3) ... [2024-11-10 18:34:08,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70718e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:08, skipping insertion in model container [2024-11-10 18:34:08,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:08" (3/3) ... [2024-11-10 18:34:08,350 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-10 18:34:08,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:34:08,366 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-10 18:34:08,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:34:08,429 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;@612bf0ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:34:08,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 18:34:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 106 states have internal predecessors, (137), 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-10 18:34:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 18:34:08,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:08,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:08,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:08,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1776229440, now seen corresponding path program 1 times [2024-11-10 18:34:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:08,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915614033] [2024-11-10 18:34:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:08,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:08,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915614033] [2024-11-10 18:34:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915614033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:08,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:08,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868614142] [2024-11-10 18:34:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:08,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:08,748 INFO L87 Difference]: Start difference. First operand has 119 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 106 states have internal predecessors, (137), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:08,950 INFO L93 Difference]: Finished difference Result 294 states and 408 transitions. [2024-11-10 18:34:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 18:34:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:08,962 INFO L225 Difference]: With dead ends: 294 [2024-11-10 18:34:08,962 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 18:34:08,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:08,971 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 100 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:08,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 379 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 18:34:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2024-11-10 18:34:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4090909090909092) internal successors, (186), 144 states have internal predecessors, (186), 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-10 18:34:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 201 transitions. [2024-11-10 18:34:09,020 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 201 transitions. Word has length 10 [2024-11-10 18:34:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,021 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 201 transitions. [2024-11-10 18:34:09,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 201 transitions. [2024-11-10 18:34:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:09,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,023 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:34:09,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash 501871211, now seen corresponding path program 1 times [2024-11-10 18:34:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132435153] [2024-11-10 18:34:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132435153] [2024-11-10 18:34:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132435153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832408083] [2024-11-10 18:34:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:09,098 INFO L87 Difference]: Start difference. First operand 156 states and 201 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,176 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2024-11-10 18:34:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-10 18:34:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,180 INFO L225 Difference]: With dead ends: 156 [2024-11-10 18:34:09,182 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 18:34:09,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:09,184 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 18:34:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-10 18:34:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.393939393939394) internal successors, (184), 143 states have internal predecessors, (184), 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-10 18:34:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2024-11-10 18:34:09,206 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 199 transitions. Word has length 17 [2024-11-10 18:34:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 199 transitions. [2024-11-10 18:34:09,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 199 transitions. [2024-11-10 18:34:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:09,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,210 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:34:09,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1621861649, now seen corresponding path program 1 times [2024-11-10 18:34:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766744304] [2024-11-10 18:34:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766744304] [2024-11-10 18:34:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766744304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712477031] [2024-11-10 18:34:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:09,319 INFO L87 Difference]: Start difference. First operand 155 states and 199 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,449 INFO L93 Difference]: Finished difference Result 221 states and 288 transitions. [2024-11-10 18:34:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:34:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,453 INFO L225 Difference]: With dead ends: 221 [2024-11-10 18:34:09,453 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 18:34:09,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:09,455 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 98 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 402 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 18:34:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2024-11-10 18:34:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 186 states have internal predecessors, (245), 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-10 18:34:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2024-11-10 18:34:09,480 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 18 [2024-11-10 18:34:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2024-11-10 18:34:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2024-11-10 18:34:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:09,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,484 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:34:09,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1576055939, now seen corresponding path program 1 times [2024-11-10 18:34:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512361040] [2024-11-10 18:34:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512361040] [2024-11-10 18:34:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512361040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159558114] [2024-11-10 18:34:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:09,607 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,718 INFO L93 Difference]: Finished difference Result 224 states and 289 transitions. [2024-11-10 18:34:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-10 18:34:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,722 INFO L225 Difference]: With dead ends: 224 [2024-11-10 18:34:09,722 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 18:34:09,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:09,725 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 89 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 404 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 18:34:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 203. [2024-11-10 18:34:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 180 states have (on average 1.3722222222222222) internal successors, (247), 190 states have internal predecessors, (247), 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-10 18:34:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 262 transitions. [2024-11-10 18:34:09,746 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 262 transitions. Word has length 18 [2024-11-10 18:34:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,746 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 262 transitions. [2024-11-10 18:34:09,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 262 transitions. [2024-11-10 18:34:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 18:34:09,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:34:09,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1883367887, now seen corresponding path program 1 times [2024-11-10 18:34:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556715611] [2024-11-10 18:34:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556715611] [2024-11-10 18:34:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556715611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309110744] [2024-11-10 18:34:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:09,823 INFO L87 Difference]: Start difference. First operand 203 states and 262 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:09,886 INFO L93 Difference]: Finished difference Result 380 states and 489 transitions. [2024-11-10 18:34:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:09,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 18:34:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:09,888 INFO L225 Difference]: With dead ends: 380 [2024-11-10 18:34:09,888 INFO L226 Difference]: Without dead ends: 219 [2024-11-10 18:34:09,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:09,890 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:09,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 219 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-10 18:34:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2024-11-10 18:34:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.345945945945946) internal successors, (249), 195 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-10 18:34:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2024-11-10 18:34:09,914 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 17 [2024-11-10 18:34:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:09,915 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2024-11-10 18:34:09,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2024-11-10 18:34:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 18:34:09,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:09,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:34:09,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:09,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1745288566, now seen corresponding path program 1 times [2024-11-10 18:34:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676237803] [2024-11-10 18:34:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676237803] [2024-11-10 18:34:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676237803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:10,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288954468] [2024-11-10 18:34:10,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:10,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:10,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:10,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:10,023 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:10,173 INFO L93 Difference]: Finished difference Result 391 states and 491 transitions. [2024-11-10 18:34:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:34:10,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 18:34:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:10,179 INFO L225 Difference]: With dead ends: 391 [2024-11-10 18:34:10,179 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 18:34:10,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:34:10,181 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 134 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:10,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 440 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 18:34:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2024-11-10 18:34:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 198 states have (on average 1.3333333333333333) internal successors, (264), 208 states have internal predecessors, (264), 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-10 18:34:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 279 transitions. [2024-11-10 18:34:10,196 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 279 transitions. Word has length 18 [2024-11-10 18:34:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:10,196 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 279 transitions. [2024-11-10 18:34:10,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 279 transitions. [2024-11-10 18:34:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:34:10,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:10,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:34:10,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1126458408, now seen corresponding path program 1 times [2024-11-10 18:34:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082926170] [2024-11-10 18:34:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082926170] [2024-11-10 18:34:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082926170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562359849] [2024-11-10 18:34:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:10,278 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-10 18:34:10,281 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-10 18:34:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:34:10,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:34:10,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562359849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-10 18:34:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281708975] [2024-11-10 18:34:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:10,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:34:10,414 INFO L87 Difference]: Start difference. First operand 221 states and 279 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:10,480 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2024-11-10 18:34:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2024-11-10 18:34:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:10,482 INFO L225 Difference]: With dead ends: 238 [2024-11-10 18:34:10,482 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 18:34:10,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-10 18:34:10,483 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:10,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 18:34:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2024-11-10 18:34:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 203 states have internal predecessors, (257), 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-10 18:34:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 272 transitions. [2024-11-10 18:34:10,494 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 272 transitions. Word has length 21 [2024-11-10 18:34:10,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:10,494 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 272 transitions. [2024-11-10 18:34:10,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2024-11-10 18:34:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:10,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:10,495 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:10,514 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-10 18:34:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:10,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:10,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -620730152, now seen corresponding path program 1 times [2024-11-10 18:34:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549381549] [2024-11-10 18:34:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:34:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549381549] [2024-11-10 18:34:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549381549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:10,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:10,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110156029] [2024-11-10 18:34:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:10,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:10,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:10,775 INFO L87 Difference]: Start difference. First operand 216 states and 272 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:10,895 INFO L93 Difference]: Finished difference Result 235 states and 296 transitions. [2024-11-10 18:34:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-10 18:34:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:10,897 INFO L225 Difference]: With dead ends: 235 [2024-11-10 18:34:10,897 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 18:34:10,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:10,898 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 93 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:10,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 414 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 18:34:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2024-11-10 18:34:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 188 states have (on average 1.3191489361702127) internal successors, (248), 196 states have internal predecessors, (248), 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-10 18:34:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2024-11-10 18:34:10,913 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 25 [2024-11-10 18:34:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:10,915 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2024-11-10 18:34:10,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2024-11-10 18:34:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:10,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:10,915 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:10,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:34:10,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:10,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash -574924442, now seen corresponding path program 1 times [2024-11-10 18:34:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784619097] [2024-11-10 18:34:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:34:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784619097] [2024-11-10 18:34:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784619097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:34:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030573013] [2024-11-10 18:34:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:34:11,000 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,127 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2024-11-10 18:34:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:34:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-10 18:34:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,129 INFO L225 Difference]: With dead ends: 237 [2024-11-10 18:34:11,129 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 18:34:11,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:34:11,130 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 86 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 410 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 18:34:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2024-11-10 18:34:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 193 states have (on average 1.310880829015544) internal successors, (253), 200 states have internal predecessors, (253), 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-10 18:34:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2024-11-10 18:34:11,147 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 25 [2024-11-10 18:34:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,147 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2024-11-10 18:34:11,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 18:34:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2024-11-10 18:34:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 18:34:11,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,149 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:34:11,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -560451295, now seen corresponding path program 1 times [2024-11-10 18:34:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897357575] [2024-11-10 18:34:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 18:34:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897357575] [2024-11-10 18:34:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897357575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:34:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968005507] [2024-11-10 18:34:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:34:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:11,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:34:11,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:11,197 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,258 INFO L93 Difference]: Finished difference Result 235 states and 299 transitions. [2024-11-10 18:34:11,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:34:11,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-10 18:34:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,260 INFO L225 Difference]: With dead ends: 235 [2024-11-10 18:34:11,260 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 18:34:11,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:34:11,261 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 225 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 18:34:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-11-10 18:34:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 177 states have (on average 1.305084745762712) internal successors, (231), 183 states have internal predecessors, (231), 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-10 18:34:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 246 transitions. [2024-11-10 18:34:11,276 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 246 transitions. Word has length 25 [2024-11-10 18:34:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 246 transitions. [2024-11-10 18:34:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:34:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 246 transitions. [2024-11-10 18:34:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:34:11,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,279 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:34:11,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 521484868, now seen corresponding path program 1 times [2024-11-10 18:34:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619765301] [2024-11-10 18:34:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:34:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619765301] [2024-11-10 18:34:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619765301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996276667] [2024-11-10 18:34:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:11,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:11,503 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-10 18:34:11,504 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-10 18:34:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:11,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:34:11,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:34:11,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996276667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-10 18:34:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398428624] [2024-11-10 18:34:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:34:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:34:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:34:11,615 INFO L87 Difference]: Start difference. First operand 196 states and 246 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:34:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:11,684 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2024-11-10 18:34:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:34:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-10 18:34:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:11,686 INFO L225 Difference]: With dead ends: 196 [2024-11-10 18:34:11,687 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 18:34:11,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:34:11,687 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:11,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 405 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 18:34:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-10 18:34:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 182 states have internal predecessors, (230), 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-10 18:34:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 245 transitions. [2024-11-10 18:34:11,699 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 245 transitions. Word has length 43 [2024-11-10 18:34:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:11,700 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 245 transitions. [2024-11-10 18:34:11,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 18:34:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 245 transitions. [2024-11-10 18:34:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 18:34:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:11,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:11,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 18:34:11,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1013838180, now seen corresponding path program 1 times [2024-11-10 18:34:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746364659] [2024-11-10 18:34:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 18:34:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746364659] [2024-11-10 18:34:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746364659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291212107] [2024-11-10 18:34:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:12,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:12,132 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-10 18:34:12,134 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-10 18:34:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:34:12,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:34:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291212107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:34:12,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:34:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-10 18:34:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756613635] [2024-11-10 18:34:12,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:34:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:34:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:34:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:12,382 INFO L87 Difference]: Start difference. First operand 195 states and 245 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 18:34:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:12,552 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions. [2024-11-10 18:34:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:34:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2024-11-10 18:34:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:12,554 INFO L225 Difference]: With dead ends: 273 [2024-11-10 18:34:12,554 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 18:34:12,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-10 18:34:12,556 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 18 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:12,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1074 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 18:34:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2024-11-10 18:34:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.2903225806451613) internal successors, (240), 192 states have internal predecessors, (240), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-10 18:34:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2024-11-10 18:34:12,567 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 44 [2024-11-10 18:34:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:12,567 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2024-11-10 18:34:12,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-10 18:34:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2024-11-10 18:34:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 18:34:12,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:12,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:12,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 18:34:12,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:12,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1548113599, now seen corresponding path program 1 times [2024-11-10 18:34:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595669030] [2024-11-10 18:34:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 18:34:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595669030] [2024-11-10 18:34:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595669030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:34:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158799250] [2024-11-10 18:34:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:34:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:34:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:34:12,976 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:13,090 INFO L93 Difference]: Finished difference Result 292 states and 362 transitions. [2024-11-10 18:34:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-10 18:34:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:13,092 INFO L225 Difference]: With dead ends: 292 [2024-11-10 18:34:13,092 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 18:34:13,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:34:13,093 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:13,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 758 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 18:34:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. [2024-11-10 18:34:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 201 states have internal predecessors, (248), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-10 18:34:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2024-11-10 18:34:13,106 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 49 [2024-11-10 18:34:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2024-11-10 18:34:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2024-11-10 18:34:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 18:34:13,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:13,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:13,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:34:13,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1794544764, now seen corresponding path program 2 times [2024-11-10 18:34:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:13,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621967040] [2024-11-10 18:34:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621967040] [2024-11-10 18:34:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621967040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788131465] [2024-11-10 18:34:13,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:34:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:13,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:13,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 18:34:13,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:34:13,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:34:13,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:34:13,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:13,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788131465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:13,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:13,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-10 18:34:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789698658] [2024-11-10 18:34:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:13,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:34:13,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:13,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:34:13,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:34:13,596 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:13,954 INFO L93 Difference]: Finished difference Result 398 states and 496 transitions. [2024-11-10 18:34:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:34:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-10 18:34:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:13,957 INFO L225 Difference]: With dead ends: 398 [2024-11-10 18:34:13,957 INFO L226 Difference]: Without dead ends: 338 [2024-11-10 18:34:13,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:13,958 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 160 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:13,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1576 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:34:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-10 18:34:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 282. [2024-11-10 18:34:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.285140562248996) internal successors, (320), 257 states have internal predecessors, (320), 16 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-10 18:34:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 356 transitions. [2024-11-10 18:34:13,979 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 356 transitions. Word has length 54 [2024-11-10 18:34:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:13,980 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 356 transitions. [2024-11-10 18:34:13,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 356 transitions. [2024-11-10 18:34:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 18:34:13,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:13,982 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:14,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:34:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:14,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1766616801, now seen corresponding path program 1 times [2024-11-10 18:34:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709037851] [2024-11-10 18:34:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:34:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:34:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709037851] [2024-11-10 18:34:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709037851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 18:34:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141741815] [2024-11-10 18:34:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:34:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:14,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:34:14,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:34:14,375 INFO L87 Difference]: Start difference. First operand 282 states and 356 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:14,515 INFO L93 Difference]: Finished difference Result 392 states and 491 transitions. [2024-11-10 18:34:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:34:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2024-11-10 18:34:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:14,517 INFO L225 Difference]: With dead ends: 392 [2024-11-10 18:34:14,518 INFO L226 Difference]: Without dead ends: 330 [2024-11-10 18:34:14,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:14,519 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 113 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:14,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 881 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-10 18:34:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 322. [2024-11-10 18:34:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 285 states have (on average 1.2842105263157895) internal successors, (366), 292 states have internal predecessors, (366), 20 states have call successors, (20), 10 states have call predecessors, (20), 12 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-10 18:34:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 409 transitions. [2024-11-10 18:34:14,534 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 409 transitions. Word has length 52 [2024-11-10 18:34:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:14,534 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 409 transitions. [2024-11-10 18:34:14,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 409 transitions. [2024-11-10 18:34:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 18:34:14,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:14,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:34:14,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 922144930, now seen corresponding path program 1 times [2024-11-10 18:34:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559068684] [2024-11-10 18:34:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 18:34:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 18:34:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559068684] [2024-11-10 18:34:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559068684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946942514] [2024-11-10 18:34:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:14,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:14,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 18:34:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:14,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:34:14,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 18:34:14,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946942514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2024-11-10 18:34:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756626587] [2024-11-10 18:34:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:14,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:34:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:34:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:34:14,869 INFO L87 Difference]: Start difference. First operand 322 states and 409 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:14,978 INFO L93 Difference]: Finished difference Result 334 states and 415 transitions. [2024-11-10 18:34:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:34:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2024-11-10 18:34:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:14,980 INFO L225 Difference]: With dead ends: 334 [2024-11-10 18:34:14,980 INFO L226 Difference]: Without dead ends: 274 [2024-11-10 18:34:14,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:14,981 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:14,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 884 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-10 18:34:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-11-10 18:34:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 241 states have (on average 1.2863070539419088) internal successors, (310), 248 states have internal predecessors, (310), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-10 18:34:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 342 transitions. [2024-11-10 18:34:14,994 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 342 transitions. Word has length 52 [2024-11-10 18:34:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:14,994 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 342 transitions. [2024-11-10 18:34:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 18:34:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 342 transitions. [2024-11-10 18:34:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 18:34:14,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:14,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:15,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 18:34:15,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 18:34:15,200 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:15,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1655950661, now seen corresponding path program 1 times [2024-11-10 18:34:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847920313] [2024-11-10 18:34:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:34:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847920313] [2024-11-10 18:34:15,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847920313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:34:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677711075] [2024-11-10 18:34:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:15,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:34:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:34:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:15,703 INFO L87 Difference]: Start difference. First operand 271 states and 342 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,140 INFO L93 Difference]: Finished difference Result 317 states and 399 transitions. [2024-11-10 18:34:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:34:16,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-10 18:34:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,143 INFO L225 Difference]: With dead ends: 317 [2024-11-10 18:34:16,143 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 18:34:16,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:16,144 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 143 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1302 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:34:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 18:34:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 270. [2024-11-10 18:34:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 241 states have (on average 1.2780082987551866) internal successors, (308), 247 states have internal predecessors, (308), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-10 18:34:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 340 transitions. [2024-11-10 18:34:16,160 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 340 transitions. Word has length 54 [2024-11-10 18:34:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,161 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 340 transitions. [2024-11-10 18:34:16,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 18:34:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 340 transitions. [2024-11-10 18:34:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 18:34:16,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,162 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:16,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 18:34:16,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 298236452, now seen corresponding path program 1 times [2024-11-10 18:34:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581638681] [2024-11-10 18:34:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 18:34:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:34:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581638681] [2024-11-10 18:34:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581638681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344777758] [2024-11-10 18:34:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,289 INFO L87 Difference]: Start difference. First operand 270 states and 340 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,338 INFO L93 Difference]: Finished difference Result 276 states and 346 transitions. [2024-11-10 18:34:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-10 18:34:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,340 INFO L225 Difference]: With dead ends: 276 [2024-11-10 18:34:16,340 INFO L226 Difference]: Without dead ends: 274 [2024-11-10 18:34:16,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,341 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 170 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-10 18:34:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2024-11-10 18:34:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.2614107883817427) internal successors, (304), 245 states have internal predecessors, (304), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-10 18:34:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 336 transitions. [2024-11-10 18:34:16,360 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 336 transitions. Word has length 67 [2024-11-10 18:34:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,361 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 336 transitions. [2024-11-10 18:34:16,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 336 transitions. [2024-11-10 18:34:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 18:34:16,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,363 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:16,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:34:16,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,364 INFO L85 PathProgramCache]: Analyzing trace with hash 655395489, now seen corresponding path program 1 times [2024-11-10 18:34:16,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567519611] [2024-11-10 18:34:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 18:34:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:34:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567519611] [2024-11-10 18:34:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567519611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:34:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844762634] [2024-11-10 18:34:16,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:34:16,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:34:16,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:34:16,554 INFO L87 Difference]: Start difference. First operand 268 states and 336 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,722 INFO L93 Difference]: Finished difference Result 422 states and 540 transitions. [2024-11-10 18:34:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2024-11-10 18:34:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,725 INFO L225 Difference]: With dead ends: 422 [2024-11-10 18:34:16,725 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 18:34:16,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:34:16,726 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 712 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 18:34:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 298. [2024-11-10 18:34:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 267 states have (on average 1.250936329588015) internal successors, (334), 271 states have internal predecessors, (334), 19 states have call successors, (19), 8 states have call predecessors, (19), 10 states have return successors, (21), 18 states have call predecessors, (21), 18 states have call successors, (21) [2024-11-10 18:34:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 374 transitions. [2024-11-10 18:34:16,746 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 374 transitions. Word has length 68 [2024-11-10 18:34:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,746 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 374 transitions. [2024-11-10 18:34:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 374 transitions. [2024-11-10 18:34:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 18:34:16,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:16,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 18:34:16,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1011626237, now seen corresponding path program 1 times [2024-11-10 18:34:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645545886] [2024-11-10 18:34:16,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 18:34:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 18:34:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645545886] [2024-11-10 18:34:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645545886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:16,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:34:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132103862] [2024-11-10 18:34:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:16,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,848 INFO L87 Difference]: Start difference. First operand 298 states and 374 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:16,895 INFO L93 Difference]: Finished difference Result 313 states and 392 transitions. [2024-11-10 18:34:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:16,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2024-11-10 18:34:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:16,897 INFO L225 Difference]: With dead ends: 313 [2024-11-10 18:34:16,897 INFO L226 Difference]: Without dead ends: 311 [2024-11-10 18:34:16,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:16,898 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:16,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 177 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-10 18:34:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2024-11-10 18:34:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 273 states have (on average 1.2380952380952381) internal successors, (338), 276 states have internal predecessors, (338), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-10 18:34:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 382 transitions. [2024-11-10 18:34:16,936 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 382 transitions. Word has length 69 [2024-11-10 18:34:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 382 transitions. [2024-11-10 18:34:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 18:34:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 382 transitions. [2024-11-10 18:34:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 18:34:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:16,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 18:34:16,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:16,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2058531516, now seen corresponding path program 1 times [2024-11-10 18:34:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261955939] [2024-11-10 18:34:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-10 18:34:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 18:34:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 18:34:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 18:34:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 18:34:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261955939] [2024-11-10 18:34:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261955939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350255516] [2024-11-10 18:34:17,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:17,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:17,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:17,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 18:34:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:17,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 18:34:17,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 18:34:17,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350255516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:17,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:17,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 16 [2024-11-10 18:34:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68556879] [2024-11-10 18:34:17,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:17,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:34:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:34:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:34:17,521 INFO L87 Difference]: Start difference. First operand 305 states and 382 transitions. Second operand has 13 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 18:34:17,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:17,903 INFO L93 Difference]: Finished difference Result 559 states and 707 transitions. [2024-11-10 18:34:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:34:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 78 [2024-11-10 18:34:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:17,905 INFO L225 Difference]: With dead ends: 559 [2024-11-10 18:34:17,905 INFO L226 Difference]: Without dead ends: 317 [2024-11-10 18:34:17,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-10 18:34:17,907 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 115 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:17,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1334 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:34:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-10 18:34:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 310. [2024-11-10 18:34:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 276 states have (on average 1.2355072463768115) internal successors, (341), 280 states have internal predecessors, (341), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-10 18:34:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 388 transitions. [2024-11-10 18:34:17,925 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 388 transitions. Word has length 78 [2024-11-10 18:34:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:17,926 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 388 transitions. [2024-11-10 18:34:17,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 18:34:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2024-11-10 18:34:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 18:34:17,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:17,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:17,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 18:34:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:18,132 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1131824900, now seen corresponding path program 1 times [2024-11-10 18:34:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559261129] [2024-11-10 18:34:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 18:34:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 18:34:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:34:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:34:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:34:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559261129] [2024-11-10 18:34:18,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559261129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:18,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883825016] [2024-11-10 18:34:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:18,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:18,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 18:34:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:34:18,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:34:18,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883825016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-10 18:34:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140473966] [2024-11-10 18:34:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:18,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:34:18,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:18,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:34:18,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:34:18,478 INFO L87 Difference]: Start difference. First operand 310 states and 388 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 18:34:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:18,600 INFO L93 Difference]: Finished difference Result 450 states and 563 transitions. [2024-11-10 18:34:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 81 [2024-11-10 18:34:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:18,603 INFO L225 Difference]: With dead ends: 450 [2024-11-10 18:34:18,603 INFO L226 Difference]: Without dead ends: 369 [2024-11-10 18:34:18,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:18,604 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:18,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 773 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-10 18:34:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2024-11-10 18:34:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 325 states have (on average 1.2215384615384615) internal successors, (397), 328 states have internal predecessors, (397), 28 states have call successors, (28), 9 states have call predecessors, (28), 11 states have return successors, (30), 27 states have call predecessors, (30), 26 states have call successors, (30) [2024-11-10 18:34:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 455 transitions. [2024-11-10 18:34:18,628 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 455 transitions. Word has length 81 [2024-11-10 18:34:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:18,628 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 455 transitions. [2024-11-10 18:34:18,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 18:34:18,629 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 455 transitions. [2024-11-10 18:34:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 18:34:18,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:18,630 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:18,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:18,832 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash 683128261, now seen corresponding path program 1 times [2024-11-10 18:34:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415587895] [2024-11-10 18:34:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 18:34:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 18:34:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 18:34:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 18:34:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 18:34:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:34:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415587895] [2024-11-10 18:34:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415587895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116890688] [2024-11-10 18:34:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:19,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:19,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 18:34:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:34:19,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:34:19,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:34:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 18:34:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116890688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:34:19,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:34:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-10 18:34:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187189334] [2024-11-10 18:34:19,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:34:19,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 18:34:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:19,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 18:34:19,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:34:19,289 INFO L87 Difference]: Start difference. First operand 365 states and 455 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-10 18:34:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:19,403 INFO L93 Difference]: Finished difference Result 498 states and 618 transitions. [2024-11-10 18:34:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:34:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 81 [2024-11-10 18:34:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:19,406 INFO L225 Difference]: With dead ends: 498 [2024-11-10 18:34:19,406 INFO L226 Difference]: Without dead ends: 347 [2024-11-10 18:34:19,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 18:34:19,407 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:19,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1085 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:34:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-10 18:34:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2024-11-10 18:34:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 310 states have (on average 1.2225806451612904) internal successors, (379), 312 states have internal predecessors, (379), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (25), 24 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-10 18:34:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 429 transitions. [2024-11-10 18:34:19,424 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 429 transitions. Word has length 81 [2024-11-10 18:34:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 429 transitions. [2024-11-10 18:34:19,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-10 18:34:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 429 transitions. [2024-11-10 18:34:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 18:34:19,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:19,426 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:19,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 18:34:19,630 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:19,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 404882879, now seen corresponding path program 1 times [2024-11-10 18:34:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74153856] [2024-11-10 18:34:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 18:34:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 18:34:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 18:34:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 18:34:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-10 18:34:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74153856] [2024-11-10 18:34:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74153856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:34:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499974672] [2024-11-10 18:34:19,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:34:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:34:19,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:34:19,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 18:34:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:19,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:34:19,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:34:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:34:19,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:34:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499974672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:34:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-10 18:34:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966086746] [2024-11-10 18:34:19,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:19,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:34:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:34:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:19,781 INFO L87 Difference]: Start difference. First operand 344 states and 429 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 18:34:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:19,831 INFO L93 Difference]: Finished difference Result 655 states and 820 transitions. [2024-11-10 18:34:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:34:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2024-11-10 18:34:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:19,833 INFO L225 Difference]: With dead ends: 655 [2024-11-10 18:34:19,833 INFO L226 Difference]: Without dead ends: 355 [2024-11-10 18:34:19,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:34:19,835 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:19,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:34:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-10 18:34:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2024-11-10 18:34:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 315 states have (on average 1.2158730158730158) internal successors, (383), 317 states have internal predecessors, (383), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (25), 24 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-10 18:34:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 433 transitions. [2024-11-10 18:34:19,851 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 433 transitions. Word has length 85 [2024-11-10 18:34:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 433 transitions. [2024-11-10 18:34:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 18:34:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 433 transitions. [2024-11-10 18:34:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 18:34:19,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:34:19,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:19,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 18:34:20,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 18:34:20,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-11-10 18:34:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:34:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1869229337, now seen corresponding path program 1 times [2024-11-10 18:34:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:34:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101542776] [2024-11-10 18:34:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:34:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:34:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:34:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 18:34:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 18:34:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 18:34:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 18:34:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 18:34:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:34:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-10 18:34:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:34:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101542776] [2024-11-10 18:34:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101542776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:34:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:34:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 18:34:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070051899] [2024-11-10 18:34:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:34:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 18:34:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:34:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 18:34:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-10 18:34:20,603 INFO L87 Difference]: Start difference. First operand 349 states and 433 transitions. Second operand has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 18:34:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:34:21,119 INFO L93 Difference]: Finished difference Result 379 states and 470 transitions. [2024-11-10 18:34:21,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 18:34:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 86 [2024-11-10 18:34:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:34:21,120 INFO L225 Difference]: With dead ends: 379 [2024-11-10 18:34:21,120 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:34:21,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-10 18:34:21,122 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 110 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:34:21,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1586 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:34:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:34:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:34:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:34:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:34:21,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2024-11-10 18:34:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:34:21,127 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:34:21,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 18:34:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:34:21,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-10 18:34:21,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-10 18:34:21,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-10 18:34:21,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 18:34:21,135 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:34:21,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:34:22,483 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:34:22,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:34:22 BoogieIcfgContainer [2024-11-10 18:34:22,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:34:22,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:34:22,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:34:22,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:34:22,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:34:08" (3/4) ... [2024-11-10 18:34:22,514 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:34:22,517 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-11-10 18:34:22,518 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure addflt [2024-11-10 18:34:22,518 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 18:34:22,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-10 18:34:22,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 18:34:22,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 18:34:22,529 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:34:22,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:34:22,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:34:22,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:34:22,629 INFO L158 Benchmark]: Toolchain (without parser) took 15279.89ms. Allocated memory was 159.4MB in the beginning and 356.5MB in the end (delta: 197.1MB). Free memory was 112.0MB in the beginning and 235.3MB in the end (delta: -123.3MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,629 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:22,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.74ms. Allocated memory is still 159.4MB. Free memory was 111.7MB in the beginning and 96.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.78ms. Allocated memory is still 159.4MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,631 INFO L158 Benchmark]: Boogie Preprocessor took 54.63ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:34:22,631 INFO L158 Benchmark]: IcfgBuilder took 541.58ms. Allocated memory is still 159.4MB. Free memory was 92.8MB in the beginning and 68.0MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,631 INFO L158 Benchmark]: TraceAbstraction took 14168.23ms. Allocated memory was 159.4MB in the beginning and 356.5MB in the end (delta: 197.1MB). Free memory was 67.0MB in the beginning and 241.6MB in the end (delta: -174.6MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,632 INFO L158 Benchmark]: Witness Printer took 117.55ms. Allocated memory is still 356.5MB. Free memory was 241.6MB in the beginning and 235.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:34:22,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.74ms. Allocated memory is still 159.4MB. Free memory was 111.7MB in the beginning and 96.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.78ms. Allocated memory is still 159.4MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.63ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 92.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 541.58ms. Allocated memory is still 159.4MB. Free memory was 92.8MB in the beginning and 68.0MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14168.23ms. Allocated memory was 159.4MB in the beginning and 356.5MB in the end (delta: 197.1MB). Free memory was 67.0MB in the beginning and 241.6MB in the end (delta: -174.6MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 117.55ms. Allocated memory is still 356.5MB. Free memory was 241.6MB in the beginning and 235.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 119 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1534 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1499 mSDsluCounter, 16261 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13298 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3778 IncrementalHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 2963 mSDtfsCounter, 3778 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1039 GetRequests, 840 SyntacticMatches, 5 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=22, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 404 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1677 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1785 ConstructedInterpolants, 4 QuantifiedInterpolants, 3251 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1404 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 36 InterpolantComputations, 23 PerfectInterpolantSequences, 576/615 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: null - InvariantResult [Line: 57]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-10 18:34:22,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE