./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:04:36,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:04:37,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:04:37,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:04:37,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:04:37,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:04:37,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:04:37,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:04:37,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:04:37,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:04:37,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:04:37,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:04:37,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:04:37,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:04:37,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:04:37,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:04:37,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:04:37,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:04:37,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:04:37,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:04:37,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:04:37,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:04:37,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:04:37,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:04:37,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:04:37,059 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:04:37,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:04:37,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:04:37,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:04:37,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:04:37,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:04:37,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:04:37,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:04:37,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:04:37,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:37,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:04:37,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:04:37,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:04:37,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:04:37,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:04:37,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:04:37,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:04:37,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:04:37,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:04:37,065 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2024-11-19 10:04:37,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:04:37,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:04:37,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:04:37,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:04:37,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:04:37,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-11-19 10:04:38,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:04:39,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:04:39,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-11-19 10:04:39,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f3bbe70/40ee130449cc46a0abedf21d3c33ac84/FLAG9b0f74d4b [2024-11-19 10:04:39,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f3bbe70/40ee130449cc46a0abedf21d3c33ac84 [2024-11-19 10:04:39,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:04:39,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:04:39,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:39,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:04:39,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:04:39,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f4c1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39, skipping insertion in model container [2024-11-19 10:04:39,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:04:39,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:39,703 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:04:39,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:04:39,756 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:04:39,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39 WrapperNode [2024-11-19 10:04:39,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:04:39,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:39,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:04:39,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:04:39,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,800 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-11-19 10:04:39,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:04:39,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:04:39,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:04:39,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:04:39,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,839 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-19 10:04:39,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:04:39,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:04:39,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:04:39,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:04:39,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (1/1) ... [2024-11-19 10:04:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:04:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:39,911 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-19 10:04:39,914 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-19 10:04:39,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:04:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:04:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 10:04:39,965 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 10:04:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:04:39,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:04:39,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:04:39,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:04:40,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:04:40,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:04:40,498 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 10:04:40,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:04:40,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:04:40,513 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:04:40,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:40 BoogieIcfgContainer [2024-11-19 10:04:40,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:04:40,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:04:40,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:04:40,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:04:40,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:39" (1/3) ... [2024-11-19 10:04:40,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e0665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:40, skipping insertion in model container [2024-11-19 10:04:40,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:39" (2/3) ... [2024-11-19 10:04:40,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e0665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:40, skipping insertion in model container [2024-11-19 10:04:40,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:40" (3/3) ... [2024-11-19 10:04:40,521 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2024-11-19 10:04:40,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:04:40,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-19 10:04:40,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:04:40,589 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;@40b92e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:04:40,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-19 10:04:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 10:04:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 10:04:40,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:40,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:40,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1302203311, now seen corresponding path program 1 times [2024-11-19 10:04:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253603761] [2024-11-19 10:04:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:40,891 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-19 10:04:40,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:40,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253603761] [2024-11-19 10:04:40,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253603761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996020143] [2024-11-19 10:04:40,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:40,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:40,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:40,921 INFO L87 Difference]: Start difference. First operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:41,087 INFO L93 Difference]: Finished difference Result 297 states and 411 transitions. [2024-11-19 10:04:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 10:04:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:41,098 INFO L225 Difference]: With dead ends: 297 [2024-11-19 10:04:41,098 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 10:04:41,105 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-19 10:04:41,108 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 90 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:41,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 393 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 10:04:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-11-19 10:04:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.495798319327731) internal successors, (178), 138 states have internal predecessors, (178), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2024-11-19 10:04:41,166 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 9 [2024-11-19 10:04:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:41,168 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2024-11-19 10:04:41,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2024-11-19 10:04:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:04:41,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:41,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:04:41,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2018629041, now seen corresponding path program 1 times [2024-11-19 10:04:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282713758] [2024-11-19 10:04:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:41,273 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-19 10:04:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:41,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282713758] [2024-11-19 10:04:41,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282713758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:41,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:41,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788540523] [2024-11-19 10:04:41,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:41,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:41,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:41,280 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:41,352 INFO L93 Difference]: Finished difference Result 301 states and 393 transitions. [2024-11-19 10:04:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 10:04:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:41,355 INFO L225 Difference]: With dead ends: 301 [2024-11-19 10:04:41,355 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 10:04:41,356 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-19 10:04:41,357 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:41,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 213 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 10:04:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-19 10:04:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 142 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 190 transitions. [2024-11-19 10:04:41,386 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 190 transitions. Word has length 14 [2024-11-19 10:04:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:41,387 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 190 transitions. [2024-11-19 10:04:41,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2024-11-19 10:04:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:04:41,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:41,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:41,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:04:41,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2018517695, now seen corresponding path program 1 times [2024-11-19 10:04:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383368593] [2024-11-19 10:04:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:04:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383368593] [2024-11-19 10:04:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383368593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:41,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:04:41,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772857942] [2024-11-19 10:04:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:41,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:41,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:41,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:41,464 INFO L87 Difference]: Start difference. First operand 149 states and 190 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:41,517 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2024-11-19 10:04:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 10:04:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:41,519 INFO L225 Difference]: With dead ends: 149 [2024-11-19 10:04:41,519 INFO L226 Difference]: Without dead ends: 148 [2024-11-19 10:04:41,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:41,520 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:41,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-19 10:04:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-19 10:04:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 141 states have internal predecessors, (180), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2024-11-19 10:04:41,545 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 14 [2024-11-19 10:04:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:41,546 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2024-11-19 10:04:41,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2024-11-19 10:04:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:04:41,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:41,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:41,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:04:41,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:41,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash 829234525, now seen corresponding path program 1 times [2024-11-19 10:04:41,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:41,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098690009] [2024-11-19 10:04:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098690009] [2024-11-19 10:04:41,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098690009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:41,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314214359] [2024-11-19 10:04:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:41,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:41,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:41,642 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-19 10:04:41,644 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-19 10:04:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:41,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:41,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:41,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314214359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 10:04:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000628098] [2024-11-19 10:04:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:41,752 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:41,828 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2024-11-19 10:04:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:41,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:04:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:41,830 INFO L225 Difference]: With dead ends: 174 [2024-11-19 10:04:41,830 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 10:04:41,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:41,832 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:41,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 208 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 10:04:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2024-11-19 10:04:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 148 states have internal predecessors, (187), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2024-11-19 10:04:41,851 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 15 [2024-11-19 10:04:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2024-11-19 10:04:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2024-11-19 10:04:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:04:41,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:41,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:41,871 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-19 10:04:42,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:42,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:42,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1850460838, now seen corresponding path program 1 times [2024-11-19 10:04:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:42,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741850053] [2024-11-19 10:04:42,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741850053] [2024-11-19 10:04:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741850053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869795348] [2024-11-19 10:04:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:42,145 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-19 10:04:42,148 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-19 10:04:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:42,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:42,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869795348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-19 10:04:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492101725] [2024-11-19 10:04:42,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:42,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:42,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:42,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:42,221 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:42,272 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2024-11-19 10:04:42,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:42,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 10:04:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:42,274 INFO L225 Difference]: With dead ends: 161 [2024-11-19 10:04:42,274 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 10:04:42,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:42,275 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:42,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 195 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 10:04:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-19 10:04:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 150 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-11-19 10:04:42,284 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 15 [2024-11-19 10:04:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:42,285 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-11-19 10:04:42,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-11-19 10:04:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:04:42,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:42,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:42,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:04:42,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:42,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:42,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -63533408, now seen corresponding path program 1 times [2024-11-19 10:04:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783899118] [2024-11-19 10:04:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:04:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783899118] [2024-11-19 10:04:42,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783899118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:04:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515693059] [2024-11-19 10:04:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:42,533 INFO L87 Difference]: Start difference. First operand 157 states and 197 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, (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-19 10:04:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:42,569 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2024-11-19 10:04:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:42,570 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 10:04:42,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:42,572 INFO L225 Difference]: With dead ends: 157 [2024-11-19 10:04:42,572 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 10:04:42,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:42,573 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:42,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 10:04:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-19 10:04:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 147 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2024-11-19 10:04:42,584 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 16 [2024-11-19 10:04:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:42,584 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2024-11-19 10:04:42,584 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, (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-19 10:04:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2024-11-19 10:04:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:04:42,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:42,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:42,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:04:42,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -801496273, now seen corresponding path program 1 times [2024-11-19 10:04:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:42,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712677001] [2024-11-19 10:04:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,614 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-19 10:04:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:42,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712677001] [2024-11-19 10:04:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712677001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659687035] [2024-11-19 10:04:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:04:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:42,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:04:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:04:42,617 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:42,660 INFO L93 Difference]: Finished difference Result 315 states and 400 transitions. [2024-11-19 10:04:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:04:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 10:04:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:42,661 INFO L225 Difference]: With dead ends: 315 [2024-11-19 10:04:42,661 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 10:04:42,662 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-19 10:04:42,663 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:42,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 10:04:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-19 10:04:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-19 10:04:42,678 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2024-11-19 10:04:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:42,678 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-19 10:04:42,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-19 10:04:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 10:04:42,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:42,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:42,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:04:42,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1421009672, now seen corresponding path program 1 times [2024-11-19 10:04:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266295244] [2024-11-19 10:04:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,745 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-19 10:04:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266295244] [2024-11-19 10:04:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266295244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:42,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960020155] [2024-11-19 10:04:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:42,747 INFO L87 Difference]: Start difference. First operand 156 states and 193 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, (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-19 10:04:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:42,851 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2024-11-19 10:04:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:42,859 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 10:04:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:42,861 INFO L225 Difference]: With dead ends: 176 [2024-11-19 10:04:42,861 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 10:04:42,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:42,862 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:42,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 10:04:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-11-19 10:04:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.39568345323741) internal successors, (194), 156 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-11-19 10:04:42,877 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 16 [2024-11-19 10:04:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:42,878 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-11-19 10:04:42,878 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, (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-19 10:04:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-11-19 10:04:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:42,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:42,879 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:42,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:04:42,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:42,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1967372727, now seen corresponding path program 1 times [2024-11-19 10:04:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756954048] [2024-11-19 10:04:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:04:42,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756954048] [2024-11-19 10:04:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756954048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:42,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801887338] [2024-11-19 10:04:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:42,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:42,978 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-19 10:04:42,980 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-19 10:04:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:04:43,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:43,054 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-19 10:04:43,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:04:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801887338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:04:43,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 10:04:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729979994] [2024-11-19 10:04:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:43,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:43,057 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:43,110 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2024-11-19 10:04:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 10:04:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:43,111 INFO L225 Difference]: With dead ends: 171 [2024-11-19 10:04:43,111 INFO L226 Difference]: Without dead ends: 170 [2024-11-19 10:04:43,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:04:43,112 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 9 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:43,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-19 10:04:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-19 10:04:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 160 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-19 10:04:43,119 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 17 [2024-11-19 10:04:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-19 10:04:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-19 10:04:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:04:43,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:43,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:43,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:43,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:43,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1720101466, now seen corresponding path program 1 times [2024-11-19 10:04:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:43,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705098180] [2024-11-19 10:04:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,368 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-19 10:04:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:43,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705098180] [2024-11-19 10:04:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705098180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89699905] [2024-11-19 10:04:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:43,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:43,370 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:43,418 INFO L93 Difference]: Finished difference Result 336 states and 412 transitions. [2024-11-19 10:04:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 10:04:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:43,419 INFO L225 Difference]: With dead ends: 336 [2024-11-19 10:04:43,419 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 10:04:43,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:43,421 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:43,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 10:04:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-19 10:04:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 164 states have internal predecessors, (201), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2024-11-19 10:04:43,427 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 17 [2024-11-19 10:04:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:43,427 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2024-11-19 10:04:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:04:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2024-11-19 10:04:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:43,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:43,428 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:43,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:04:43,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:43,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -448658972, now seen corresponding path program 1 times [2024-11-19 10:04:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298277192] [2024-11-19 10:04:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,473 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-19 10:04:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298277192] [2024-11-19 10:04:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298277192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651678588] [2024-11-19 10:04:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:43,477 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:43,591 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2024-11-19 10:04:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 10:04:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:43,593 INFO L225 Difference]: With dead ends: 235 [2024-11-19 10:04:43,593 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 10:04:43,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:43,594 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:43,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 10:04:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2024-11-19 10:04:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 210 states have internal predecessors, (261), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2024-11-19 10:04:43,608 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 24 [2024-11-19 10:04:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:43,609 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2024-11-19 10:04:43,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2024-11-19 10:04:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:43,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:43,610 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:43,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:04:43,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:43,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash -477286328, now seen corresponding path program 1 times [2024-11-19 10:04:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006013009] [2024-11-19 10:04:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:43,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,668 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-19 10:04:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006013009] [2024-11-19 10:04:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006013009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436235125] [2024-11-19 10:04:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:43,670 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:43,761 INFO L93 Difference]: Finished difference Result 233 states and 281 transitions. [2024-11-19 10:04:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 10:04:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:43,764 INFO L225 Difference]: With dead ends: 233 [2024-11-19 10:04:43,764 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 10:04:43,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:43,765 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:43,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 305 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 10:04:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 210. [2024-11-19 10:04:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 201 states have internal predecessors, (248), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2024-11-19 10:04:43,776 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 24 [2024-11-19 10:04:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:43,776 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2024-11-19 10:04:43,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2024-11-19 10:04:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:43,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:43,777 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] [2024-11-19 10:04:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:04:43,777 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:43,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash -555382723, now seen corresponding path program 1 times [2024-11-19 10:04:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:43,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660572015] [2024-11-19 10:04:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,837 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-19 10:04:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660572015] [2024-11-19 10:04:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660572015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076927856] [2024-11-19 10:04:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:43,842 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-19 10:04:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:43,891 INFO L93 Difference]: Finished difference Result 368 states and 448 transitions. [2024-11-19 10:04:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:43,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2024-11-19 10:04:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:43,892 INFO L225 Difference]: With dead ends: 368 [2024-11-19 10:04:43,893 INFO L226 Difference]: Without dead ends: 187 [2024-11-19 10:04:43,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-19 10:04:43,896 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 37 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:43,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-19 10:04:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-19 10:04:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 175 states have internal predecessors, (215), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2024-11-19 10:04:43,905 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 24 [2024-11-19 10:04:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:43,905 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2024-11-19 10:04:43,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-19 10:04:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2024-11-19 10:04:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:04:43,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:43,907 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] [2024-11-19 10:04:43,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 10:04:43,908 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 63091986, now seen corresponding path program 1 times [2024-11-19 10:04:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073172770] [2024-11-19 10:04:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:43,956 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-19 10:04:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073172770] [2024-11-19 10:04:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073172770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:43,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162483534] [2024-11-19 10:04:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:43,958 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-19 10:04:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:44,045 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2024-11-19 10:04:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:04:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2024-11-19 10:04:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:44,048 INFO L225 Difference]: With dead ends: 355 [2024-11-19 10:04:44,048 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 10:04:44,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 10:04:44,049 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:44,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 383 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 10:04:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2024-11-19 10:04:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 187 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-19 10:04:44,059 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 24 [2024-11-19 10:04:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:44,059 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-19 10:04:44,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-19 10:04:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-19 10:04:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 10:04:44,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:44,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:04:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 10:04:44,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 324492628, now seen corresponding path program 1 times [2024-11-19 10:04:44,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247747917] [2024-11-19 10:04:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 10:04:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247747917] [2024-11-19 10:04:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247747917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:44,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:04:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006560687] [2024-11-19 10:04:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:44,106 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-19 10:04:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:44,175 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2024-11-19 10:04:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:04:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 29 [2024-11-19 10:04:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:44,176 INFO L225 Difference]: With dead ends: 201 [2024-11-19 10:04:44,176 INFO L226 Difference]: Without dead ends: 200 [2024-11-19 10:04:44,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 10:04:44,177 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:44,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-19 10:04:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2024-11-19 10:04:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 177 states have internal predecessors, (217), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-19 10:04:44,188 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 29 [2024-11-19 10:04:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:44,189 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-19 10:04:44,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-19 10:04:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-19 10:04:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 10:04:44,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:44,190 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-19 10:04:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:04:44,190 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1973004361, now seen corresponding path program 1 times [2024-11-19 10:04:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720719721] [2024-11-19 10:04:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:04:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720719721] [2024-11-19 10:04:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720719721] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250226907] [2024-11-19 10:04:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:44,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:44,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:44,318 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-19 10:04:44,319 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-19 10:04:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:44,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:04:44,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 10:04:44,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 10:04:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250226907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:44,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-19 10:04:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19796476] [2024-11-19 10:04:44,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:04:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:04:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:04:44,610 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:04:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:44,878 INFO L93 Difference]: Finished difference Result 652 states and 826 transitions. [2024-11-19 10:04:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:04:44,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-19 10:04:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:44,882 INFO L225 Difference]: With dead ends: 652 [2024-11-19 10:04:44,882 INFO L226 Difference]: Without dead ends: 501 [2024-11-19 10:04:44,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:04:44,883 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 261 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:44,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 444 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:04:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-19 10:04:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 206. [2024-11-19 10:04:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 197 states have internal predecessors, (241), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 249 transitions. [2024-11-19 10:04:44,898 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 249 transitions. Word has length 44 [2024-11-19 10:04:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:44,899 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 249 transitions. [2024-11-19 10:04:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 10:04:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 249 transitions. [2024-11-19 10:04:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 10:04:44,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:44,900 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-19 10:04:44,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:45,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 10:04:45,100 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:45,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1869642328, now seen corresponding path program 1 times [2024-11-19 10:04:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748689185] [2024-11-19 10:04:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:04:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748689185] [2024-11-19 10:04:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748689185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388628851] [2024-11-19 10:04:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:45,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:45,180 INFO L87 Difference]: Start difference. First operand 206 states and 249 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:45,275 INFO L93 Difference]: Finished difference Result 210 states and 252 transitions. [2024-11-19 10:04:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-19 10:04:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:45,277 INFO L225 Difference]: With dead ends: 210 [2024-11-19 10:04:45,277 INFO L226 Difference]: Without dead ends: 207 [2024-11-19 10:04:45,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:45,277 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:45,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-19 10:04:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2024-11-19 10:04:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 187 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-19 10:04:45,289 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 47 [2024-11-19 10:04:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-19 10:04:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-19 10:04:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 10:04:45,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:45,291 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-19 10:04:45,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 10:04:45,291 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1898269684, now seen corresponding path program 1 times [2024-11-19 10:04:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:45,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143545701] [2024-11-19 10:04:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 10:04:45,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143545701] [2024-11-19 10:04:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143545701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678366368] [2024-11-19 10:04:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:45,340 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:45,426 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-11-19 10:04:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:45,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-19 10:04:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:45,428 INFO L225 Difference]: With dead ends: 204 [2024-11-19 10:04:45,428 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 10:04:45,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 10:04:45,428 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 138 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:45,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 10:04:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2024-11-19 10:04:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 176 states have internal predecessors, (217), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 225 transitions. [2024-11-19 10:04:45,456 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 225 transitions. Word has length 47 [2024-11-19 10:04:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 225 transitions. [2024-11-19 10:04:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2024-11-19 10:04:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 10:04:45,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:45,457 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 10:04:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 10:04:45,458 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:45,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1454050813, now seen corresponding path program 1 times [2024-11-19 10:04:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088173672] [2024-11-19 10:04:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 10:04:45,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:45,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088173672] [2024-11-19 10:04:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088173672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:45,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:04:45,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237537289] [2024-11-19 10:04:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:45,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:04:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:04:45,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:04:45,527 INFO L87 Difference]: Start difference. First operand 185 states and 225 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:45,586 INFO L93 Difference]: Finished difference Result 347 states and 423 transitions. [2024-11-19 10:04:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:04:45,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-19 10:04:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:45,588 INFO L225 Difference]: With dead ends: 347 [2024-11-19 10:04:45,588 INFO L226 Difference]: Without dead ends: 210 [2024-11-19 10:04:45,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:45,589 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 11 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:45,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 302 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:04:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-19 10:04:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 181. [2024-11-19 10:04:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 172 states have internal predecessors, (210), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2024-11-19 10:04:45,602 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 47 [2024-11-19 10:04:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:45,602 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2024-11-19 10:04:45,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2024-11-19 10:04:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 10:04:45,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:45,603 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 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] [2024-11-19 10:04:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 10:04:45,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -338960106, now seen corresponding path program 1 times [2024-11-19 10:04:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013953588] [2024-11-19 10:04:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:45,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013953588] [2024-11-19 10:04:45,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013953588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:04:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:04:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:04:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705367955] [2024-11-19 10:04:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:04:45,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:04:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:04:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:04:45,698 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:45,801 INFO L93 Difference]: Finished difference Result 398 states and 478 transitions. [2024-11-19 10:04:45,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:04:45,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-19 10:04:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:45,803 INFO L225 Difference]: With dead ends: 398 [2024-11-19 10:04:45,803 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 10:04:45,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:04:45,804 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:45,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:04:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 10:04:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 181. [2024-11-19 10:04:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 172 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2024-11-19 10:04:45,818 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 48 [2024-11-19 10:04:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:45,819 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2024-11-19 10:04:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 10:04:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2024-11-19 10:04:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 10:04:45,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:45,820 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 10:04:45,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 10:04:45,820 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:45,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1180459864, now seen corresponding path program 1 times [2024-11-19 10:04:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013803223] [2024-11-19 10:04:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013803223] [2024-11-19 10:04:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013803223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197295564] [2024-11-19 10:04:45,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:45,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:45,963 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-19 10:04:45,965 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-19 10:04:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:46,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 10:04:46,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:46,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197295564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:46,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 19 [2024-11-19 10:04:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918131287] [2024-11-19 10:04:46,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:46,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 10:04:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 10:04:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-11-19 10:04:46,634 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:47,290 INFO L93 Difference]: Finished difference Result 522 states and 622 transitions. [2024-11-19 10:04:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 10:04:47,291 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-19 10:04:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:47,292 INFO L225 Difference]: With dead ends: 522 [2024-11-19 10:04:47,293 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 10:04:47,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=416, Unknown=0, NotChecked=0, Total=650 [2024-11-19 10:04:47,294 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 163 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:47,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 846 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 10:04:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 10:04:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 181. [2024-11-19 10:04:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 172 states have internal predecessors, (205), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2024-11-19 10:04:47,310 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 53 [2024-11-19 10:04:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2024-11-19 10:04:47,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2024-11-19 10:04:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 10:04:47,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:47,311 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2024-11-19 10:04:47,329 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-19 10:04:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:47,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:47,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash 302294674, now seen corresponding path program 1 times [2024-11-19 10:04:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:47,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850917103] [2024-11-19 10:04:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850917103] [2024-11-19 10:04:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850917103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:47,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937026917] [2024-11-19 10:04:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:04:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:47,716 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-19 10:04:47,718 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-19 10:04:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:04:47,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:04:47,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:47,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937026917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:48,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-19 10:04:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870018812] [2024-11-19 10:04:48,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 10:04:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 10:04:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-11-19 10:04:48,179 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:04:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:48,627 INFO L93 Difference]: Finished difference Result 969 states and 1207 transitions. [2024-11-19 10:04:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 10:04:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-19 10:04:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:48,633 INFO L225 Difference]: With dead ends: 969 [2024-11-19 10:04:48,633 INFO L226 Difference]: Without dead ends: 843 [2024-11-19 10:04:48,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-11-19 10:04:48,636 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 488 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:48,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 534 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 10:04:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-19 10:04:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2024-11-19 10:04:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 212 states have internal predecessors, (253), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2024-11-19 10:04:48,668 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 64 [2024-11-19 10:04:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:48,668 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2024-11-19 10:04:48,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:04:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2024-11-19 10:04:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 10:04:48,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:48,669 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 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] [2024-11-19 10:04:48,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 10:04:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:48,870 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 85610712, now seen corresponding path program 2 times [2024-11-19 10:04:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541158773] [2024-11-19 10:04:48,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:04:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:48,921 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:04:48,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:04:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541158773] [2024-11-19 10:04:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541158773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381093582] [2024-11-19 10:04:49,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:04:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:49,203 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-19 10:04:49,204 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-19 10:04:49,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:04:49,314 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:04:49,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 10:04:49,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:50,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381093582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:52,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 17] total 40 [2024-11-19 10:04:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148171139] [2024-11-19 10:04:52,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 10:04:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 10:04:52,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=1087, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 10:04:52,483 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:04:58,107 INFO L93 Difference]: Finished difference Result 710 states and 846 transitions. [2024-11-19 10:04:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 10:04:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-19 10:04:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:04:58,111 INFO L225 Difference]: With dead ends: 710 [2024-11-19 10:04:58,111 INFO L226 Difference]: Without dead ends: 556 [2024-11-19 10:04:58,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=923, Invalid=1939, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 10:04:58,112 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 395 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:04:58,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1998 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-19 10:04:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-19 10:04:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 221. [2024-11-19 10:04:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 212 states have internal predecessors, (245), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:04:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2024-11-19 10:04:58,146 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 73 [2024-11-19 10:04:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:04:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2024-11-19 10:04:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 40 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:04:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2024-11-19 10:04:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 10:04:58,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:04:58,149 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2024-11-19 10:04:58,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:04:58,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:58,350 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:04:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:04:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1727507346, now seen corresponding path program 2 times [2024-11-19 10:04:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:04:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854612679] [2024-11-19 10:04:58,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:04:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:04:58,365 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:04:58,365 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:04:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:04:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854612679] [2024-11-19 10:04:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854612679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:04:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113280090] [2024-11-19 10:04:58,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:04:58,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:04:58,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:04:58,750 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-19 10:04:58,752 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-19 10:04:58,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:04:58,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:04:58,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 10:04:58,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:04:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:59,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:04:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:04:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113280090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:04:59,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:04:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-11-19 10:04:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558915178] [2024-11-19 10:04:59,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:04:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 10:04:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:04:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 10:04:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 10:04:59,764 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:05:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:05:00,631 INFO L93 Difference]: Finished difference Result 1689 states and 2119 transitions. [2024-11-19 10:05:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 10:05:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-19 10:05:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:05:00,637 INFO L225 Difference]: With dead ends: 1689 [2024-11-19 10:05:00,637 INFO L226 Difference]: Without dead ends: 1563 [2024-11-19 10:05:00,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-11-19 10:05:00,638 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1089 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 10:05:00,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1087 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 10:05:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-19 10:05:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 301. [2024-11-19 10:05:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 292 states have internal predecessors, (341), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 10:05:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 349 transitions. [2024-11-19 10:05:00,671 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 349 transitions. Word has length 104 [2024-11-19 10:05:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:05:00,671 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 349 transitions. [2024-11-19 10:05:00,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 10:05:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 349 transitions. [2024-11-19 10:05:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 10:05:00,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:05:00,673 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 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] [2024-11-19 10:05:00,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 10:05:00,877 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,SelfDestructingSolverStorable23 [2024-11-19 10:05:00,878 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-19 10:05:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:05:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash 12381144, now seen corresponding path program 3 times [2024-11-19 10:05:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:05:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782609021] [2024-11-19 10:05:00,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:05:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:05:00,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 10:05:00,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:05:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:05:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:05:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782609021] [2024-11-19 10:05:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782609021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:05:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126421311] [2024-11-19 10:05:01,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 10:05:01,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:05:01,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:05:01,840 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-19 10:05:01,841 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-19 10:05:02,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-19 10:05:02,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:05:02,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 10:05:02,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:05:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:05:05,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:05:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 10:05:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126421311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:05:13,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:05:13,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-11-19 10:05:13,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910186628] [2024-11-19 10:05:13,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:05:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-19 10:05:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:05:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-19 10:05:13,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1890, Invalid=4430, Unknown=0, NotChecked=0, Total=6320 [2024-11-19 10:05:13,772 INFO L87 Difference]: Start difference. First operand 301 states and 349 transitions. Second operand has 80 states, 80 states have (on average 3.3625) internal successors, (269), 80 states have internal predecessors, (269), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 10:05:27,457 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 97 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)