./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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_2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:52:12,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:52:12,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 03:52:12,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:52:12,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:52:12,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:52:12,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:52:12,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:52:12,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:52:12,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:52:12,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:52:12,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:52:12,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:52:12,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:52:12,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:52:12,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:52:12,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 03:52:12,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:52:12,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:52:12,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:52:12,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:52:12,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 03:52:12,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:52:12,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 03:52:12,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:52:12,699 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 03:52:12,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:52:12,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:52:12,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 03:52:12,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:52:12,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:52:12,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:52:12,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:52:12,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:52:12,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:12,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:52:12,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:52:12,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 03:52:12,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:52:12,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:52:12,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:52:12,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:52:12,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:52:12,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:52:12,704 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2024-11-17 03:52:12,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:52:12,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:52:12,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:52:12,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:52:12,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:52:12,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-11-17 03:52:14,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:52:14,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:52:14,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-11-17 03:52:14,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac61cafd7/27e03f25fa6a488ba18491806bdb5187/FLAGedddf113d [2024-11-17 03:52:15,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac61cafd7/27e03f25fa6a488ba18491806bdb5187 [2024-11-17 03:52:15,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:52:15,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:52:15,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:15,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:52:15,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:52:15,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5902dc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15, skipping insertion in model container [2024-11-17 03:52:15,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:52:15,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:15,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:52:15,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:52:15,318 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:52:15,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15 WrapperNode [2024-11-17 03:52:15,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:52:15,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:15,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:52:15,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:52:15,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,364 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-11-17 03:52:15,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:52:15,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:52:15,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:52:15,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:52:15,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,386 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-17 03:52:15,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:52:15,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:52:15,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:52:15,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:52:15,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (1/1) ... [2024-11-17 03:52:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:52:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:15,429 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-17 03:52:15,430 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-17 03:52:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:52:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:52:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-17 03:52:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-17 03:52:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:52:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:52:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:52:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:52:15,534 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:52:15,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:52:15,882 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-17 03:52:15,882 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:52:15,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:52:15,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:52:15,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:15 BoogieIcfgContainer [2024-11-17 03:52:15,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:52:15,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:52:15,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:52:15,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:52:15,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:52:15" (1/3) ... [2024-11-17 03:52:15,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:15, skipping insertion in model container [2024-11-17 03:52:15,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:52:15" (2/3) ... [2024-11-17 03:52:15,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33408e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:52:15, skipping insertion in model container [2024-11-17 03:52:15,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:52:15" (3/3) ... [2024-11-17 03:52:15,914 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2024-11-17 03:52:15,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:52:15,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-17 03:52:15,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:52:15,986 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;@73c22b41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:52:15,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-17 03:52:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 104 states have (on average 1.5673076923076923) internal successors, (163), 129 states have internal predecessors, (163), 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-17 03:52:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 03:52:15,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:15,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:15,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1425326163, now seen corresponding path program 1 times [2024-11-17 03:52:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205132988] [2024-11-17 03:52:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:16,235 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-17 03:52:16,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:16,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205132988] [2024-11-17 03:52:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205132988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328948988] [2024-11-17 03:52:16,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:16,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:16,271 INFO L87 Difference]: Start difference. First operand has 136 states, 104 states have (on average 1.5673076923076923) internal successors, (163), 129 states have internal predecessors, (163), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 03:52:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:16,445 INFO L93 Difference]: Finished difference Result 338 states and 452 transitions. [2024-11-17 03:52:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-17 03:52:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:16,489 INFO L225 Difference]: With dead ends: 338 [2024-11-17 03:52:16,489 INFO L226 Difference]: Without dead ends: 185 [2024-11-17 03:52:16,492 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-17 03:52:16,501 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 110 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:16,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 411 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-17 03:52:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2024-11-17 03:52:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 164 states have internal predecessors, (204), 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-17 03:52:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2024-11-17 03:52:16,598 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 11 [2024-11-17 03:52:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2024-11-17 03:52:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-17 03:52:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2024-11-17 03:52:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 03:52:16,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:16,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:52:16,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:16,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2113387370, now seen corresponding path program 1 times [2024-11-17 03:52:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:16,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601913886] [2024-11-17 03:52:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:16,658 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-17 03:52:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601913886] [2024-11-17 03:52:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601913886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:16,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050497166] [2024-11-17 03:52:16,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:16,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:16,665 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:16,715 INFO L93 Difference]: Finished difference Result 356 states and 448 transitions. [2024-11-17 03:52:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:16,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 03:52:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:16,717 INFO L225 Difference]: With dead ends: 356 [2024-11-17 03:52:16,717 INFO L226 Difference]: Without dead ends: 188 [2024-11-17 03:52:16,718 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-17 03:52:16,719 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 16 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:16,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 230 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-17 03:52:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2024-11-17 03:52:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 152 states have (on average 1.388157894736842) internal successors, (211), 171 states have internal predecessors, (211), 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-17 03:52:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2024-11-17 03:52:16,747 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 18 [2024-11-17 03:52:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:16,748 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2024-11-17 03:52:16,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2024-11-17 03:52:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:16,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:16,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:16,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:52:16,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1076337395, now seen corresponding path program 1 times [2024-11-17 03:52:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977818547] [2024-11-17 03:52:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 03:52:16,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977818547] [2024-11-17 03:52:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977818547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:52:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540661780] [2024-11-17 03:52:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:16,796 INFO L87 Difference]: Start difference. First operand 178 states and 219 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-17 03:52:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:16,835 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2024-11-17 03:52:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 03:52:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:16,837 INFO L225 Difference]: With dead ends: 178 [2024-11-17 03:52:16,837 INFO L226 Difference]: Without dead ends: 177 [2024-11-17 03:52:16,838 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-17 03:52:16,839 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:16,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-17 03:52:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-17 03:52:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.375) internal successors, (209), 170 states have internal predecessors, (209), 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-17 03:52:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2024-11-17 03:52:16,848 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 19 [2024-11-17 03:52:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:16,849 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2024-11-17 03:52:16,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (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-17 03:52:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2024-11-17 03:52:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:16,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:16,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:16,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:52:16,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1090649955, now seen corresponding path program 1 times [2024-11-17 03:52:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446564101] [2024-11-17 03:52:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:16,939 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-17 03:52:16,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:16,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446564101] [2024-11-17 03:52:16,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446564101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:16,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:16,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217933572] [2024-11-17 03:52:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:16,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:16,941 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:17,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:17,062 INFO L93 Difference]: Finished difference Result 384 states and 470 transitions. [2024-11-17 03:52:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:52:17,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 03:52:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:17,063 INFO L225 Difference]: With dead ends: 384 [2024-11-17 03:52:17,063 INFO L226 Difference]: Without dead ends: 210 [2024-11-17 03:52:17,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:52:17,067 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 158 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:17,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 408 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:17,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-17 03:52:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2024-11-17 03:52:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 185 states have internal predecessors, (226), 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-17 03:52:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2024-11-17 03:52:17,088 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 19 [2024-11-17 03:52:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:17,088 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2024-11-17 03:52:17,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2024-11-17 03:52:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 03:52:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:17,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:52:17,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:17,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash 103338956, now seen corresponding path program 1 times [2024-11-17 03:52:17,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:17,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177613269] [2024-11-17 03:52:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:17,120 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-17 03:52:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177613269] [2024-11-17 03:52:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177613269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989487093] [2024-11-17 03:52:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:17,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:52:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:17,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:52:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:52:17,123 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:17,158 INFO L93 Difference]: Finished difference Result 392 states and 483 transitions. [2024-11-17 03:52:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:52:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 03:52:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:17,159 INFO L225 Difference]: With dead ends: 392 [2024-11-17 03:52:17,159 INFO L226 Difference]: Without dead ends: 203 [2024-11-17 03:52:17,160 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-17 03:52:17,161 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:17,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 228 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-17 03:52:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2024-11-17 03:52:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.3411764705882352) internal successors, (228), 188 states have internal predecessors, (228), 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-17 03:52:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2024-11-17 03:52:17,179 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 19 [2024-11-17 03:52:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:17,179 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2024-11-17 03:52:17,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:52:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2024-11-17 03:52:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:52:17,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:17,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:52:17,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:17,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -993279123, now seen corresponding path program 1 times [2024-11-17 03:52:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909779359] [2024-11-17 03:52:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909779359] [2024-11-17 03:52:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909779359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450881572] [2024-11-17 03:52:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:17,246 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-17 03:52:17,247 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-17 03:52:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:17,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:52:17,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:17,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:52:17,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450881572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:17,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 03:52:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-17 03:52:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479247009] [2024-11-17 03:52:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:52:17,328 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-17 03:52:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:17,392 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2024-11-17 03:52:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 20 [2024-11-17 03:52:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:17,394 INFO L225 Difference]: With dead ends: 217 [2024-11-17 03:52:17,394 INFO L226 Difference]: Without dead ends: 216 [2024-11-17 03:52:17,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-17 03:52:17,395 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 28 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:17,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 311 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-17 03:52:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 201. [2024-11-17 03:52:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3295454545454546) internal successors, (234), 194 states have internal predecessors, (234), 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-17 03:52:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2024-11-17 03:52:17,410 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 20 [2024-11-17 03:52:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:17,410 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2024-11-17 03:52:17,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-17 03:52:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2024-11-17 03:52:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:52:17,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:17,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:17,426 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-17 03:52:17,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-17 03:52:17,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash -549589779, now seen corresponding path program 1 times [2024-11-17 03:52:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124152427] [2024-11-17 03:52:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:17,693 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-17 03:52:17,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:17,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124152427] [2024-11-17 03:52:17,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124152427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:17,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:17,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:17,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032663161] [2024-11-17 03:52:17,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:17,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:17,694 INFO L87 Difference]: Start difference. First operand 201 states and 242 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 03:52:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:17,803 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2024-11-17 03:52:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 20 [2024-11-17 03:52:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:17,805 INFO L225 Difference]: With dead ends: 220 [2024-11-17 03:52:17,805 INFO L226 Difference]: Without dead ends: 218 [2024-11-17 03:52:17,805 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-17 03:52:17,805 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:17,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 410 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-17 03:52:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2024-11-17 03:52:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 201 states have internal predecessors, (240), 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-17 03:52:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2024-11-17 03:52:17,816 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 20 [2024-11-17 03:52:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:17,816 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2024-11-17 03:52:17,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 03:52:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2024-11-17 03:52:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:52:17,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:17,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:52:17,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash -894412688, now seen corresponding path program 1 times [2024-11-17 03:52:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756841999] [2024-11-17 03:52:17,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:17,912 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-17 03:52:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756841999] [2024-11-17 03:52:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756841999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664141143] [2024-11-17 03:52:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:17,914 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-17 03:52:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:17,983 INFO L93 Difference]: Finished difference Result 418 states and 498 transitions. [2024-11-17 03:52:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2024-11-17 03:52:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:17,984 INFO L225 Difference]: With dead ends: 418 [2024-11-17 03:52:17,984 INFO L226 Difference]: Without dead ends: 213 [2024-11-17 03:52:17,985 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-17 03:52:17,985 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:17,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-17 03:52:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-17 03:52:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 187 states have (on average 1.304812834224599) internal successors, (244), 205 states have internal predecessors, (244), 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-17 03:52:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2024-11-17 03:52:17,991 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 20 [2024-11-17 03:52:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:17,991 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2024-11-17 03:52:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-17 03:52:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2024-11-17 03:52:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 03:52:17,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:17,992 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:52:17,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:17,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1158100971, now seen corresponding path program 1 times [2024-11-17 03:52:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997069239] [2024-11-17 03:52:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,032 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-17 03:52:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997069239] [2024-11-17 03:52:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997069239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491788028] [2024-11-17 03:52:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:18,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:18,034 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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-17 03:52:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,124 INFO L93 Difference]: Finished difference Result 287 states and 343 transitions. [2024-11-17 03:52:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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 26 [2024-11-17 03:52:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,126 INFO L225 Difference]: With dead ends: 287 [2024-11-17 03:52:18,126 INFO L226 Difference]: Without dead ends: 284 [2024-11-17 03:52:18,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:18,127 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 172 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 329 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-17 03:52:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2024-11-17 03:52:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 234 states have (on average 1.311965811965812) internal successors, (307), 251 states have internal predecessors, (307), 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-17 03:52:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 315 transitions. [2024-11-17 03:52:18,134 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 315 transitions. Word has length 26 [2024-11-17 03:52:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,135 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 315 transitions. [2024-11-17 03:52:18,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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-17 03:52:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 315 transitions. [2024-11-17 03:52:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 03:52:18,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,136 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:18,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:52:18,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 232320531, now seen corresponding path program 1 times [2024-11-17 03:52:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946762330] [2024-11-17 03:52:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,176 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-17 03:52:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946762330] [2024-11-17 03:52:18,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946762330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963865570] [2024-11-17 03:52:18,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:18,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:18,178 INFO L87 Difference]: Start difference. First operand 260 states and 315 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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-17 03:52:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,279 INFO L93 Difference]: Finished difference Result 282 states and 333 transitions. [2024-11-17 03:52:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:18,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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 26 [2024-11-17 03:52:18,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,281 INFO L225 Difference]: With dead ends: 282 [2024-11-17 03:52:18,281 INFO L226 Difference]: Without dead ends: 278 [2024-11-17 03:52:18,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:52:18,281 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 160 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 327 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-17 03:52:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 263. [2024-11-17 03:52:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 238 states have (on average 1.2857142857142858) internal successors, (306), 254 states have internal predecessors, (306), 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-17 03:52:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 314 transitions. [2024-11-17 03:52:18,290 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 314 transitions. Word has length 26 [2024-11-17 03:52:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,290 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 314 transitions. [2024-11-17 03:52:18,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (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-17 03:52:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 314 transitions. [2024-11-17 03:52:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 03:52:18,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,291 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:52:18,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1662093059, now seen corresponding path program 1 times [2024-11-17 03:52:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532891147] [2024-11-17 03:52:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 03:52:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532891147] [2024-11-17 03:52:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532891147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786656836] [2024-11-17 03:52:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:18,334 INFO L87 Difference]: Start difference. First operand 263 states and 314 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 03:52:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,386 INFO L93 Difference]: Finished difference Result 444 states and 529 transitions. [2024-11-17 03:52:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:18,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2024-11-17 03:52:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,387 INFO L225 Difference]: With dead ends: 444 [2024-11-17 03:52:18,387 INFO L226 Difference]: Without dead ends: 232 [2024-11-17 03:52:18,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:18,388 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 48 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 343 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-17 03:52:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-17 03:52:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 221 states have internal predecessors, (265), 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-17 03:52:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 273 transitions. [2024-11-17 03:52:18,395 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 273 transitions. Word has length 27 [2024-11-17 03:52:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,396 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 273 transitions. [2024-11-17 03:52:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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-17 03:52:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 273 transitions. [2024-11-17 03:52:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 03:52:18,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,396 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-17 03:52:18,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:52:18,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1562741430, now seen corresponding path program 1 times [2024-11-17 03:52:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47112643] [2024-11-17 03:52:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 03:52:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47112643] [2024-11-17 03:52:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47112643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:52:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677311008] [2024-11-17 03:52:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:18,427 INFO L87 Difference]: Start difference. First operand 230 states and 273 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-17 03:52:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,484 INFO L93 Difference]: Finished difference Result 241 states and 286 transitions. [2024-11-17 03:52:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:52:18,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 34 [2024-11-17 03:52:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,485 INFO L225 Difference]: With dead ends: 241 [2024-11-17 03:52:18,485 INFO L226 Difference]: Without dead ends: 239 [2024-11-17 03:52:18,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:18,486 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 12 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 304 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-17 03:52:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 222. [2024-11-17 03:52:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 197 states have (on average 1.284263959390863) internal successors, (253), 213 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-17 03:52:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2024-11-17 03:52:18,493 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 34 [2024-11-17 03:52:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2024-11-17 03:52:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-17 03:52:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2024-11-17 03:52:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 03:52:18,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,494 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:18,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:52:18,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,495 INFO L85 PathProgramCache]: Analyzing trace with hash 525945455, now seen corresponding path program 1 times [2024-11-17 03:52:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136926976] [2024-11-17 03:52:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 03:52:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 03:52:18,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136926976] [2024-11-17 03:52:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136926976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:18,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114350521] [2024-11-17 03:52:18,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:18,553 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 03:52:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,663 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2024-11-17 03:52:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 53 [2024-11-17 03:52:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,666 INFO L225 Difference]: With dead ends: 237 [2024-11-17 03:52:18,666 INFO L226 Difference]: Without dead ends: 235 [2024-11-17 03:52:18,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-17 03:52:18,667 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 166 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 357 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-17 03:52:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2024-11-17 03:52:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 211 states have internal predecessors, (250), 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-17 03:52:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2024-11-17 03:52:18,675 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 53 [2024-11-17 03:52:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,675 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2024-11-17 03:52:18,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 03:52:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2024-11-17 03:52:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-17 03:52:18,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,676 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, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:52:18,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1916366957, now seen corresponding path program 1 times [2024-11-17 03:52:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008063149] [2024-11-17 03:52:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-17 03:52:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,770 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-17 03:52:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008063149] [2024-11-17 03:52:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008063149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180028727] [2024-11-17 03:52:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:18,771 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 03:52:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:18,866 INFO L93 Difference]: Finished difference Result 229 states and 266 transitions. [2024-11-17 03:52:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 53 [2024-11-17 03:52:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:18,868 INFO L225 Difference]: With dead ends: 229 [2024-11-17 03:52:18,868 INFO L226 Difference]: Without dead ends: 226 [2024-11-17 03:52:18,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-17 03:52:18,868 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:18,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 360 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-17 03:52:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2024-11-17 03:52:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 191 states have (on average 1.2617801047120418) internal successors, (241), 203 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-17 03:52:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 249 transitions. [2024-11-17 03:52:18,878 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 249 transitions. Word has length 53 [2024-11-17 03:52:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:18,879 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 249 transitions. [2024-11-17 03:52:18,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-17 03:52:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 249 transitions. [2024-11-17 03:52:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 03:52:18,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:18,880 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:52:18,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1594618581, now seen corresponding path program 1 times [2024-11-17 03:52:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191943759] [2024-11-17 03:52:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:19,018 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-17 03:52:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191943759] [2024-11-17 03:52:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191943759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:52:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276481473] [2024-11-17 03:52:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:19,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:52:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:52:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:52:19,020 INFO L87 Difference]: Start difference. First operand 212 states and 249 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-17 03:52:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:19,070 INFO L93 Difference]: Finished difference Result 418 states and 492 transitions. [2024-11-17 03:52:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:52:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 54 [2024-11-17 03:52:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:19,071 INFO L225 Difference]: With dead ends: 418 [2024-11-17 03:52:19,071 INFO L226 Difference]: Without dead ends: 243 [2024-11-17 03:52:19,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-17 03:52:19,072 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 17 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:19,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 327 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:52:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-17 03:52:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 208. [2024-11-17 03:52:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 199 states have internal predecessors, (234), 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-17 03:52:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2024-11-17 03:52:19,080 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 54 [2024-11-17 03:52:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:19,081 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2024-11-17 03:52:19,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-17 03:52:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2024-11-17 03:52:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 03:52:19,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:19,081 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:19,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:52:19,082 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:19,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 199438971, now seen corresponding path program 1 times [2024-11-17 03:52:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725900620] [2024-11-17 03:52:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725900620] [2024-11-17 03:52:19,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725900620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:19,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418133837] [2024-11-17 03:52:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:19,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:19,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:19,182 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-17 03:52:19,183 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-17 03:52:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:19,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:52:19,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:19,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418133837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:19,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-17 03:52:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975109848] [2024-11-17 03:52:19,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:19,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:52:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:52:19,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:52:19,465 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-17 03:52:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:19,762 INFO L93 Difference]: Finished difference Result 759 states and 906 transitions. [2024-11-17 03:52:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:52:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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 55 [2024-11-17 03:52:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:19,764 INFO L225 Difference]: With dead ends: 759 [2024-11-17 03:52:19,764 INFO L226 Difference]: Without dead ends: 595 [2024-11-17 03:52:19,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 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-17 03:52:19,765 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 206 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:19,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 528 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:52:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-17 03:52:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 240. [2024-11-17 03:52:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 219 states have (on average 1.2328767123287672) internal successors, (270), 231 states have internal predecessors, (270), 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-17 03:52:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 278 transitions. [2024-11-17 03:52:19,781 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 278 transitions. Word has length 55 [2024-11-17 03:52:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 278 transitions. [2024-11-17 03:52:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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-17 03:52:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 278 transitions. [2024-11-17 03:52:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 03:52:19,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:19,782 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:52:19,798 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-17 03:52:19,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 03:52:19,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:19,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash 968082575, now seen corresponding path program 1 times [2024-11-17 03:52:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:19,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155091093] [2024-11-17 03:52:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,105 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-17 03:52:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155091093] [2024-11-17 03:52:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155091093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:52:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:52:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:52:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870451064] [2024-11-17 03:52:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:52:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:52:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:52:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:52:20,108 INFO L87 Difference]: Start difference. First operand 240 states and 278 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-17 03:52:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:20,265 INFO L93 Difference]: Finished difference Result 512 states and 594 transitions. [2024-11-17 03:52:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:52:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 55 [2024-11-17 03:52:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:20,267 INFO L225 Difference]: With dead ends: 512 [2024-11-17 03:52:20,267 INFO L226 Difference]: Without dead ends: 337 [2024-11-17 03:52:20,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-17 03:52:20,268 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:20,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 378 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:52:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-17 03:52:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 240. [2024-11-17 03:52:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 219 states have (on average 1.2283105022831051) internal successors, (269), 231 states have internal predecessors, (269), 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-17 03:52:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2024-11-17 03:52:20,279 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 55 [2024-11-17 03:52:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:20,280 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2024-11-17 03:52:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-17 03:52:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2024-11-17 03:52:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 03:52:20,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:20,280 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-17 03:52:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:52:20,281 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:20,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:20,281 INFO L85 PathProgramCache]: Analyzing trace with hash -859088375, now seen corresponding path program 1 times [2024-11-17 03:52:20,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:20,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656469347] [2024-11-17 03:52:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656469347] [2024-11-17 03:52:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656469347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587074526] [2024-11-17 03:52:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:20,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:20,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:20,505 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-17 03:52:20,506 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-17 03:52:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:20,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 03:52:20,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:21,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587074526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:21,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-17 03:52:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128614449] [2024-11-17 03:52:21,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:21,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:52:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:52:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:52:21,321 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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-17 03:52:25,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-17 03:52:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:26,064 INFO L93 Difference]: Finished difference Result 649 states and 751 transitions. [2024-11-17 03:52:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 03:52:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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 63 [2024-11-17 03:52:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:26,066 INFO L225 Difference]: With dead ends: 649 [2024-11-17 03:52:26,066 INFO L226 Difference]: Without dead ends: 457 [2024-11-17 03:52:26,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-11-17 03:52:26,067 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 178 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:26,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 946 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-17 03:52:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-17 03:52:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 240. [2024-11-17 03:52:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 219 states have (on average 1.2100456621004567) internal successors, (265), 231 states have internal predecessors, (265), 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-17 03:52:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2024-11-17 03:52:26,086 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 63 [2024-11-17 03:52:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:26,086 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2024-11-17 03:52:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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-17 03:52:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2024-11-17 03:52:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:52:26,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:26,087 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 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, 1, 1, 1] [2024-11-17 03:52:26,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 03:52:26,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 03:52:26,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:26,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 377023587, now seen corresponding path program 2 times [2024-11-17 03:52:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712405235] [2024-11-17 03:52:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 9 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712405235] [2024-11-17 03:52:26,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712405235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:26,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802609401] [2024-11-17 03:52:26,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:52:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:26,468 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-17 03:52:26,469 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-17 03:52:26,518 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:52:26,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:52:26,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:52:26,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 9 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:26,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 9 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:26,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802609401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:26,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-17 03:52:26,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982217607] [2024-11-17 03:52:26,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:26,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 03:52:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 03:52:26,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-11-17 03:52:26,999 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-17 03:52:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:27,505 INFO L93 Difference]: Finished difference Result 1198 states and 1438 transitions. [2024-11-17 03:52:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 03:52:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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 87 [2024-11-17 03:52:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:27,508 INFO L225 Difference]: With dead ends: 1198 [2024-11-17 03:52:27,508 INFO L226 Difference]: Without dead ends: 1034 [2024-11-17 03:52:27,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-11-17 03:52:27,509 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 602 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:27,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 969 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 03:52:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-17 03:52:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 304. [2024-11-17 03:52:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.1908127208480566) internal successors, (337), 295 states have internal predecessors, (337), 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-17 03:52:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 345 transitions. [2024-11-17 03:52:27,526 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 345 transitions. Word has length 87 [2024-11-17 03:52:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:27,526 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 345 transitions. [2024-11-17 03:52:27,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 26 states have internal predecessors, (196), 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-17 03:52:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 345 transitions. [2024-11-17 03:52:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 03:52:27,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:27,530 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1] [2024-11-17 03:52:27,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 03:52:27,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:27,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1151118321, now seen corresponding path program 2 times [2024-11-17 03:52:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15680245] [2024-11-17 03:52:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15680245] [2024-11-17 03:52:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15680245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66568072] [2024-11-17 03:52:28,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:52:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:28,232 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-17 03:52:28,233 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-17 03:52:28,384 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:52:28,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:52:28,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 03:52:28,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:30,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:31,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66568072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:31,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:31,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-11-17 03:52:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864810745] [2024-11-17 03:52:31,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:31,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-17 03:52:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-17 03:52:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-11-17 03:52:31,900 INFO L87 Difference]: Start difference. First operand 304 states and 345 transitions. Second operand has 41 states, 41 states have (on average 5.121951219512195) internal successors, (210), 41 states have internal predecessors, (210), 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-17 03:52:38,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-17 03:52:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:42,204 INFO L93 Difference]: Finished difference Result 936 states and 1074 transitions. [2024-11-17 03:52:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 03:52:42,204 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.121951219512195) internal successors, (210), 41 states have internal predecessors, (210), 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 95 [2024-11-17 03:52:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:42,206 INFO L225 Difference]: With dead ends: 936 [2024-11-17 03:52:42,207 INFO L226 Difference]: Without dead ends: 741 [2024-11-17 03:52:42,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-11-17 03:52:42,208 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 585 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 117 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:42,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 2033 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 987 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-17 03:52:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-17 03:52:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 304. [2024-11-17 03:52:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.1625441696113075) internal successors, (329), 295 states have internal predecessors, (329), 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-17 03:52:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 337 transitions. [2024-11-17 03:52:42,232 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 337 transitions. Word has length 95 [2024-11-17 03:52:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 337 transitions. [2024-11-17 03:52:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.121951219512195) internal successors, (210), 41 states have internal predecessors, (210), 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-17 03:52:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 337 transitions. [2024-11-17 03:52:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-17 03:52:42,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:42,233 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 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, 1, 1, 1] [2024-11-17 03:52:42,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:52:42,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:42,438 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:42,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 893354035, now seen corresponding path program 3 times [2024-11-17 03:52:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499473599] [2024-11-17 03:52:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 9 proven. 784 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:42,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499473599] [2024-11-17 03:52:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499473599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598829010] [2024-11-17 03:52:42,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:52:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:42,932 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-17 03:52:42,933 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-17 03:52:42,997 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-17 03:52:42,997 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:52:42,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 03:52:43,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 9 proven. 784 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:43,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:52:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 9 proven. 784 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598829010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:52:44,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:52:44,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-11-17 03:52:44,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139166182] [2024-11-17 03:52:44,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:52:44,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 03:52:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:52:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 03:52:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 03:52:44,320 INFO L87 Difference]: Start difference. First operand 304 states and 337 transitions. Second operand has 50 states, 50 states have (on average 7.76) internal successors, (388), 50 states have internal predecessors, (388), 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-17 03:52:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:52:45,263 INFO L93 Difference]: Finished difference Result 2102 states and 2534 transitions. [2024-11-17 03:52:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-17 03:52:45,264 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 7.76) internal successors, (388), 50 states have internal predecessors, (388), 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 151 [2024-11-17 03:52:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:52:45,269 INFO L225 Difference]: With dead ends: 2102 [2024-11-17 03:52:45,269 INFO L226 Difference]: Without dead ends: 1938 [2024-11-17 03:52:45,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-11-17 03:52:45,271 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1580 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:52:45,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 877 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 03:52:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2024-11-17 03:52:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 432. [2024-11-17 03:52:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 411 states have (on average 1.1508515815085159) internal successors, (473), 423 states have internal predecessors, (473), 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-17 03:52:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 481 transitions. [2024-11-17 03:52:45,294 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 481 transitions. Word has length 151 [2024-11-17 03:52:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:52:45,295 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 481 transitions. [2024-11-17 03:52:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 7.76) internal successors, (388), 50 states have internal predecessors, (388), 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-17 03:52:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 481 transitions. [2024-11-17 03:52:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 03:52:45,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:52:45,296 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1] [2024-11-17 03:52:45,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 03:52:45,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:45,497 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-17 03:52:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:52:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 12218305, now seen corresponding path program 3 times [2024-11-17 03:52:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:52:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124473906] [2024-11-17 03:52:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:52:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:52:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 03:52:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 03:52:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:52:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 18 proven. 728 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:46,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:52:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124473906] [2024-11-17 03:52:46,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124473906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:52:46,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112424526] [2024-11-17 03:52:46,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:52:46,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:52:46,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:52:46,284 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-17 03:52:46,285 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-17 03:52:46,582 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-17 03:52:46,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:52:46,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-17 03:52:46,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:52:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 18 proven. 728 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:52:50,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:53:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 18 proven. 728 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 03:53:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112424526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:53:00,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:53:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33, 32] total 78 [2024-11-17 03:53:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29842916] [2024-11-17 03:53:00,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:53:00,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-11-17 03:53:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:53:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-11-17 03:53:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1582, Invalid=4424, Unknown=0, NotChecked=0, Total=6006 [2024-11-17 03:53:00,735 INFO L87 Difference]: Start difference. First operand 432 states and 481 transitions. Second operand has 78 states, 78 states have (on average 5.102564102564102) internal successors, (398), 78 states have internal predecessors, (398), 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)