/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:50:35,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:50:35,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:50:35,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:50:35,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:50:35,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:50:35,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:50:35,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:50:35,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:50:35,459 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:50:35,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:50:35,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:50:35,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:50:35,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:50:35,461 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:50:35,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:50:35,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:50:35,461 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:50:35,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:50:35,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:50:35,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:50:35,464 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:50:35,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:50:35,464 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:50:35,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:50:35,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:50:35,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:50:35,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:50:35,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:50:35,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:50:35,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:50:35,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:50:35,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:50:35,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:50:35,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:50:35,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:50:35,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:50:35,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:50:35,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:50:35,468 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:50:35,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:50:35,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:50:35,472 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:50:35,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:50:35,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:50:35,473 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:50:35,473 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 [2023-12-22 02:50:35,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:50:35,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:50:35,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:50:35,703 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:50:35,703 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:50:35,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c [2023-12-22 02:50:36,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:50:37,041 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:50:37,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c [2023-12-22 02:50:37,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448cdd33f/a418cfaf50d54841b222b150798e5071/FLAG84e899fc8 [2023-12-22 02:50:37,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/448cdd33f/a418cfaf50d54841b222b150798e5071 [2023-12-22 02:50:37,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:50:37,065 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:50:37,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:50:37,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:50:37,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:50:37,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e70784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37, skipping insertion in model container [2023-12-22 02:50:37,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,105 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:50:37,245 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c[1998,2011] [2023-12-22 02:50:37,251 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c[2367,2380] [2023-12-22 02:50:37,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:50:37,295 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:50:37,307 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c[1998,2011] [2023-12-22 02:50:37,308 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_5a.c.cil.c[2367,2380] [2023-12-22 02:50:37,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:50:37,334 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:50:37,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37 WrapperNode [2023-12-22 02:50:37,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:50:37,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:50:37,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:50:37,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:50:37,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,371 INFO L138 Inliner]: procedures = 28, calls = 17, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2023-12-22 02:50:37,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:50:37,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:50:37,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:50:37,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:50:37,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,393 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]. [2023-12-22 02:50:37,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:50:37,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:50:37,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:50:37,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:50:37,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (1/1) ... [2023-12-22 02:50:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:50:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:50:37,447 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) [2023-12-22 02:50:37,454 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 [2023-12-22 02:50:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:50:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:50:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-22 02:50:37,470 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-22 02:50:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:50:37,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:50:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-22 02:50:37,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-22 02:50:37,530 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:50:37,531 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:50:42,054 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:50:42,071 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:50:42,072 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-22 02:50:42,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:50:42 BoogieIcfgContainer [2023-12-22 02:50:42,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:50:42,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:50:42,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:50:42,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:50:42,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:50:37" (1/3) ... [2023-12-22 02:50:42,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df36ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:50:42, skipping insertion in model container [2023-12-22 02:50:42,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:50:37" (2/3) ... [2023-12-22 02:50:42,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df36ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:50:42, skipping insertion in model container [2023-12-22 02:50:42,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:50:42" (3/3) ... [2023-12-22 02:50:42,079 INFO L112 eAbstractionObserver]: Analyzing ICFG square_5+soft_float_5a.c.cil.c [2023-12-22 02:50:42,090 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:50:42,091 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:50:42,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:50:42,136 INFO L357 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, mHoare=true, 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;@54b2edbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:50:42,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:50:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 48 states have internal predecessors, (73), 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) [2023-12-22 02:50:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:50:42,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:50:42,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:50:42,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:50:42,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:50:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1797094946, now seen corresponding path program 1 times [2023-12-22 02:50:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:50:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059057007] [2023-12-22 02:50:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:50:42,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:50:42,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:50:42,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:50:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-22 02:50:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:50:42,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 02:50:42,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:50:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:50:42,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:50:42,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:50:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059057007] [2023-12-22 02:50:42,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059057007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:50:42,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:50:42,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:50:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557692116] [2023-12-22 02:50:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:50:42,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 02:50:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:50:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 02:50:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:50:42,692 INFO L87 Difference]: Start difference. First operand has 55 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 48 states have internal predecessors, (73), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:50:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:50:42,754 INFO L93 Difference]: Finished difference Result 106 states and 164 transitions. [2023-12-22 02:50:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 02:50:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 02:50:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:50:42,765 INFO L225 Difference]: With dead ends: 106 [2023-12-22 02:50:42,765 INFO L226 Difference]: Without dead ends: 49 [2023-12-22 02:50:42,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:50:42,772 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:50:42,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:50:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-22 02:50:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-22 02:50:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-22 02:50:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2023-12-22 02:50:42,800 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 6 [2023-12-22 02:50:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:50:42,801 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2023-12-22 02:50:42,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:50:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2023-12-22 02:50:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:50:42,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:50:42,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:50:42,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:50:43,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:50:43,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:50:43,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:50:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1797035364, now seen corresponding path program 1 times [2023-12-22 02:50:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:50:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123241552] [2023-12-22 02:50:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:50:43,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:50:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:50:43,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:50:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 03:01:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:11,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:01:11,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:20,097 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:01:28,197 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:01:36,349 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-22 03:01:52,840 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:01,017 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:09,328 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:21,577 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:29,890 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:38,205 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:02:42,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 2797.0 2000.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from false [2023-12-22 03:02:46,416 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 2797.0 2000.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from true [2023-12-22 03:02:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 03:02:46,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:02:46,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:02:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123241552] [2023-12-22 03:02:46,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123241552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:02:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:02:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:02:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944124217] [2023-12-22 03:02:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:02:46,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:02:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:02:46,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:02:46,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-22 03:02:46,419 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 03:02:50,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:02:54,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:02:58,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)))) (fp.lt |c_ULTIMATE.start_main1_~IN~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 03:02:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:02:59,202 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2023-12-22 03:02:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:02:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 03:02:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:02:59,203 INFO L225 Difference]: With dead ends: 49 [2023-12-22 03:02:59,203 INFO L226 Difference]: Without dead ends: 44 [2023-12-22 03:02:59,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2023-12-22 03:02:59,205 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:02:59,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 162 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 136 Unchecked, 8.5s Time] [2023-12-22 03:02:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-22 03:02:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-22 03:02:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-22 03:02:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2023-12-22 03:02:59,209 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 6 [2023-12-22 03:02:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:02:59,209 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2023-12-22 03:02:59,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 03:02:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2023-12-22 03:02:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 03:02:59,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:02:59,211 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:02:59,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-22 03:02:59,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:02:59,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:02:59,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:02:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2006561597, now seen corresponding path program 1 times [2023-12-22 03:02:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:02:59,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244113703] [2023-12-22 03:02:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:02:59,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:02:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:02:59,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:02:59,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-22 03:02:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:02:59,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:02:59,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:02:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:02:59,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:02:59,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:02:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244113703] [2023-12-22 03:02:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244113703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:02:59,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:02:59,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:02:59,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306542517] [2023-12-22 03:02:59,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:02:59,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:02:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:02:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:02:59,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:02:59,618 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:00,112 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2023-12-22 03:03:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:03:00,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-12-22 03:03:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:00,115 INFO L225 Difference]: With dead ends: 97 [2023-12-22 03:03:00,115 INFO L226 Difference]: Without dead ends: 56 [2023-12-22 03:03:00,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:03:00,116 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:00,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 03:03:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-22 03:03:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-22 03:03:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-22 03:03:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2023-12-22 03:03:00,124 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 37 [2023-12-22 03:03:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2023-12-22 03:03:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2023-12-22 03:03:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-22 03:03:00,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:00,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:00,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-22 03:03:00,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:00,335 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:00,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -744847675, now seen corresponding path program 1 times [2023-12-22 03:03:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:00,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204392043] [2023-12-22 03:03:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:00,341 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-22 03:03:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:00,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:03:00,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:00,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:03:00,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204392043] [2023-12-22 03:03:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204392043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:03:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:03:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:03:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89959054] [2023-12-22 03:03:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:03:00,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:03:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:00,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:03:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:03:00,580 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:01,025 INFO L93 Difference]: Finished difference Result 99 states and 144 transitions. [2023-12-22 03:03:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 03:03:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-12-22 03:03:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:01,026 INFO L225 Difference]: With dead ends: 99 [2023-12-22 03:03:01,027 INFO L226 Difference]: Without dead ends: 58 [2023-12-22 03:03:01,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:03:01,028 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:01,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 03:03:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-22 03:03:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2023-12-22 03:03:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:03:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-12-22 03:03:01,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 40 [2023-12-22 03:03:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:01,034 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-12-22 03:03:01,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-12-22 03:03:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 03:03:01,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:01,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:01,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-22 03:03:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:01,237 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:01,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1911535032, now seen corresponding path program 1 times [2023-12-22 03:03:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003876433] [2023-12-22 03:03:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:01,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:01,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:01,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:01,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 03:03:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:01,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:03:01,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:01,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:03:01,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003876433] [2023-12-22 03:03:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003876433] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:03:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:03:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:03:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787153858] [2023-12-22 03:03:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:03:01,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:03:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:03:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:03:01,488 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:02,005 INFO L93 Difference]: Finished difference Result 106 states and 154 transitions. [2023-12-22 03:03:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:03:02,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-12-22 03:03:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:02,007 INFO L225 Difference]: With dead ends: 106 [2023-12-22 03:03:02,007 INFO L226 Difference]: Without dead ends: 61 [2023-12-22 03:03:02,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:03:02,008 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:02,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 03:03:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-22 03:03:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-12-22 03:03:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:03:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2023-12-22 03:03:02,017 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 41 [2023-12-22 03:03:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:02,018 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2023-12-22 03:03:02,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2023-12-22 03:03:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-22 03:03:02,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:02,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:02,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-22 03:03:02,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:02,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:02,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1998722342, now seen corresponding path program 1 times [2023-12-22 03:03:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829299751] [2023-12-22 03:03:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:02,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:02,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:02,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-22 03:03:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:02,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:03:02,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:02,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:03:02,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829299751] [2023-12-22 03:03:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829299751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:03:02,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:03:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:03:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250594162] [2023-12-22 03:03:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:03:02,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:03:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:03:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:03:02,564 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:03,521 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2023-12-22 03:03:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:03:03,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-12-22 03:03:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:03,534 INFO L225 Difference]: With dead ends: 113 [2023-12-22 03:03:03,534 INFO L226 Difference]: Without dead ends: 67 [2023-12-22 03:03:03,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:03:03,535 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:03,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 170 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-22 03:03:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-22 03:03:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2023-12-22 03:03:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 46 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:03:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2023-12-22 03:03:03,540 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 42 [2023-12-22 03:03:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:03,541 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2023-12-22 03:03:03,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:03:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2023-12-22 03:03:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-22 03:03:03,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:03,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:03,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-22 03:03:03,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:03,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:03,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1306723989, now seen corresponding path program 1 times [2023-12-22 03:03:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261863436] [2023-12-22 03:03:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:03,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:03,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:03,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:03,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 03:03:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:03,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:03:03,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:04,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:03:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:03:04,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:04,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261863436] [2023-12-22 03:03:04,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261863436] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:03:04,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:03:04,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 03:03:04,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35855766] [2023-12-22 03:03:04,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:03:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 03:03:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 03:03:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:03:04,692 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:05,827 INFO L93 Difference]: Finished difference Result 130 states and 192 transitions. [2023-12-22 03:03:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-22 03:03:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-12-22 03:03:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:05,829 INFO L225 Difference]: With dead ends: 130 [2023-12-22 03:03:05,829 INFO L226 Difference]: Without dead ends: 83 [2023-12-22 03:03:05,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-22 03:03:05,830 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 49 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:05,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-22 03:03:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-22 03:03:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 62. [2023-12-22 03:03:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:03:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2023-12-22 03:03:05,839 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 43 [2023-12-22 03:03:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:05,839 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2023-12-22 03:03:05,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2023-12-22 03:03:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-22 03:03:05,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:05,840 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-12-22 03:03:05,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-22 03:03:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:06,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:06,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2125864714, now seen corresponding path program 1 times [2023-12-22 03:03:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:06,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219855749] [2023-12-22 03:03:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:06,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-22 03:03:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:06,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:03:06,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:06,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:03:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:03:07,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:07,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219855749] [2023-12-22 03:03:07,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219855749] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:03:07,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:03:07,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-22 03:03:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054972942] [2023-12-22 03:03:07,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:03:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-22 03:03:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:07,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-22 03:03:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-22 03:03:07,267 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:09,204 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2023-12-22 03:03:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-22 03:03:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2023-12-22 03:03:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:09,206 INFO L225 Difference]: With dead ends: 146 [2023-12-22 03:03:09,206 INFO L226 Difference]: Without dead ends: 91 [2023-12-22 03:03:09,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-22 03:03:09,207 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:09,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 228 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-22 03:03:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-22 03:03:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2023-12-22 03:03:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:03:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2023-12-22 03:03:09,214 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 45 [2023-12-22 03:03:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:09,214 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2023-12-22 03:03:09,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2023-12-22 03:03:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 03:03:09,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:09,215 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:09,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-22 03:03:09,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:09,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:09,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash -520854843, now seen corresponding path program 2 times [2023-12-22 03:03:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:09,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160904932] [2023-12-22 03:03:09,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:03:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:09,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-22 03:03:09,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:03:09,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:03:09,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:03:09,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-22 03:03:09,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:03:09,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160904932] [2023-12-22 03:03:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160904932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:03:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:03:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-22 03:03:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536448326] [2023-12-22 03:03:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:03:09,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:03:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:03:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:03:09,864 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:03:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:10,496 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2023-12-22 03:03:10,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 03:03:10,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-12-22 03:03:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:10,497 INFO L225 Difference]: With dead ends: 104 [2023-12-22 03:03:10,497 INFO L226 Difference]: Without dead ends: 84 [2023-12-22 03:03:10,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-22 03:03:10,498 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:10,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 310 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 03:03:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-22 03:03:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2023-12-22 03:03:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 68 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:03:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2023-12-22 03:03:10,505 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 52 [2023-12-22 03:03:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:10,505 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2023-12-22 03:03:10,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:03:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2023-12-22 03:03:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-22 03:03:10,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:10,506 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:10,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 03:03:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:10,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:10,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 159203527, now seen corresponding path program 1 times [2023-12-22 03:03:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546490639] [2023-12-22 03:03:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:10,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:10,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-22 03:03:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:10,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:03:10,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:11,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:03:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:03:13,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546490639] [2023-12-22 03:03:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546490639] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:03:13,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:03:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-22 03:03:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146542112] [2023-12-22 03:03:13,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:03:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-22 03:03:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-22 03:03:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-12-22 03:03:13,171 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:17,881 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2023-12-22 03:03:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-22 03:03:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-22 03:03:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:17,883 INFO L225 Difference]: With dead ends: 203 [2023-12-22 03:03:17,883 INFO L226 Difference]: Without dead ends: 133 [2023-12-22 03:03:17,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2023-12-22 03:03:17,884 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 119 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:17,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 468 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-22 03:03:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-22 03:03:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2023-12-22 03:03:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.4625) internal successors, (117), 82 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:03:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2023-12-22 03:03:17,893 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 52 [2023-12-22 03:03:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:17,893 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2023-12-22 03:03:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2023-12-22 03:03:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-22 03:03:17,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:17,894 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:17,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 03:03:18,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:18,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:18,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1984062200, now seen corresponding path program 1 times [2023-12-22 03:03:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:18,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134521080] [2023-12-22 03:03:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:18,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:18,097 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:18,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-22 03:03:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:18,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 03:03:18,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:19,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:03:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:03:21,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134521080] [2023-12-22 03:03:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134521080] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:03:21,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:03:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-22 03:03:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480835217] [2023-12-22 03:03:21,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:03:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-22 03:03:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-22 03:03:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-22 03:03:21,253 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:27,332 INFO L93 Difference]: Finished difference Result 226 states and 340 transitions. [2023-12-22 03:03:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-22 03:03:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-22 03:03:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:27,334 INFO L225 Difference]: With dead ends: 226 [2023-12-22 03:03:27,334 INFO L226 Difference]: Without dead ends: 142 [2023-12-22 03:03:27,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2023-12-22 03:03:27,335 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 170 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:27,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 628 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-22 03:03:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-22 03:03:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 101. [2023-12-22 03:03:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.488888888888889) internal successors, (134), 92 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:03:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2023-12-22 03:03:27,365 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 57 [2023-12-22 03:03:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:27,365 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2023-12-22 03:03:27,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2023-12-22 03:03:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-22 03:03:27,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:27,366 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:27,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-22 03:03:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:27,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:27,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1478669625, now seen corresponding path program 2 times [2023-12-22 03:03:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222677072] [2023-12-22 03:03:27,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:03:27,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:27,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:27,572 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:27,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-22 03:03:27,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:03:27,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:03:27,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 03:03:27,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-22 03:03:27,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:03:27,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222677072] [2023-12-22 03:03:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222677072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:03:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:03:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 03:03:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95945991] [2023-12-22 03:03:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:03:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 03:03:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 03:03:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 03:03:27,745 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:03:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:27,824 INFO L93 Difference]: Finished difference Result 123 states and 182 transitions. [2023-12-22 03:03:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 03:03:27,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2023-12-22 03:03:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:27,826 INFO L225 Difference]: With dead ends: 123 [2023-12-22 03:03:27,827 INFO L226 Difference]: Without dead ends: 101 [2023-12-22 03:03:27,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 03:03:27,827 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:27,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 03:03:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-22 03:03:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-22 03:03:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4666666666666666) internal successors, (132), 92 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:03:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2023-12-22 03:03:27,841 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 70 [2023-12-22 03:03:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:27,842 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2023-12-22 03:03:27,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:03:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2023-12-22 03:03:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-22 03:03:27,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:27,842 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:27,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-22 03:03:28,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:28,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:28,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1444529269, now seen corresponding path program 1 times [2023-12-22 03:03:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053037818] [2023-12-22 03:03:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:28,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:28,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:28,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:28,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-22 03:03:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:28,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-22 03:03:28,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 19 proven. 155 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:30,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:03:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 3 proven. 161 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:03:34,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:03:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053037818] [2023-12-22 03:03:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053037818] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:03:34,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:03:34,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-12-22 03:03:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300733028] [2023-12-22 03:03:34,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:03:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-22 03:03:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:03:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-22 03:03:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-12-22 03:03:34,345 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:03:50,909 INFO L93 Difference]: Finished difference Result 311 states and 468 transitions. [2023-12-22 03:03:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-22 03:03:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2023-12-22 03:03:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:03:50,911 INFO L225 Difference]: With dead ends: 311 [2023-12-22 03:03:50,911 INFO L226 Difference]: Without dead ends: 217 [2023-12-22 03:03:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2023-12-22 03:03:50,913 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 440 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:03:50,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 955 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-12-22 03:03:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-22 03:03:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 127. [2023-12-22 03:03:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 118 states have internal predecessors, (175), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:03:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2023-12-22 03:03:50,926 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 72 [2023-12-22 03:03:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:03:50,926 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2023-12-22 03:03:50,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:03:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2023-12-22 03:03:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 03:03:50,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:03:50,927 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:03:50,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 03:03:51,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:51,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:03:51,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:03:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -535735428, now seen corresponding path program 1 times [2023-12-22 03:03:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:03:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269273029] [2023-12-22 03:03:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:03:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:03:51,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:03:51,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:03:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-22 03:03:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:03:51,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-22 03:03:51,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:03:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 19 proven. 273 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:03:54,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:04:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 3 proven. 279 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:04:00,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:04:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269273029] [2023-12-22 03:04:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269273029] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:04:00,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:04:00,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-12-22 03:04:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804131523] [2023-12-22 03:04:00,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:04:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-22 03:04:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:04:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-22 03:04:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-12-22 03:04:00,355 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 34 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:04:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:04:16,293 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2023-12-22 03:04:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-22 03:04:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 34 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-12-22 03:04:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:04:16,305 INFO L225 Difference]: With dead ends: 320 [2023-12-22 03:04:16,305 INFO L226 Difference]: Without dead ends: 200 [2023-12-22 03:04:16,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2023-12-22 03:04:16,306 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 529 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:04:16,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1054 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-12-22 03:04:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-22 03:04:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 131. [2023-12-22 03:04:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 122 states have internal predecessors, (182), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:04:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 200 transitions. [2023-12-22 03:04:16,319 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 200 transitions. Word has length 83 [2023-12-22 03:04:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:04:16,320 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 200 transitions. [2023-12-22 03:04:16,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.4705882352941178) internal successors, (118), 34 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:04:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 200 transitions. [2023-12-22 03:04:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-22 03:04:16,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:04:16,321 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:04:16,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 03:04:16,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:04:16,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:04:16,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:04:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 837144459, now seen corresponding path program 2 times [2023-12-22 03:04:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:04:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429916987] [2023-12-22 03:04:16,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:04:16,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:04:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:04:16,523 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:04:16,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-22 03:04:16,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:04:16,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:04:16,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:04:16,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:04:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2023-12-22 03:04:16,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:04:16,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:04:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429916987] [2023-12-22 03:04:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429916987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:04:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:04:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:04:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358734840] [2023-12-22 03:04:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:04:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:04:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:04:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:04:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:04:16,825 INFO L87 Difference]: Start difference. First operand 131 states and 200 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:04:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:04:17,193 INFO L93 Difference]: Finished difference Result 150 states and 226 transitions. [2023-12-22 03:04:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:04:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2023-12-22 03:04:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:04:17,195 INFO L225 Difference]: With dead ends: 150 [2023-12-22 03:04:17,195 INFO L226 Difference]: Without dead ends: 145 [2023-12-22 03:04:17,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:04:17,196 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 03:04:17,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 03:04:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-22 03:04:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2023-12-22 03:04:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 124 states have (on average 1.5080645161290323) internal successors, (187), 126 states have internal predecessors, (187), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:04:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2023-12-22 03:04:17,220 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 108 [2023-12-22 03:04:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:04:17,220 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2023-12-22 03:04:17,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:04:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2023-12-22 03:04:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-22 03:04:17,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:04:17,221 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:04:17,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-22 03:04:17,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:04:17,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:04:17,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:04:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2099323249, now seen corresponding path program 1 times [2023-12-22 03:04:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:04:17,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211640090] [2023-12-22 03:04:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:04:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:04:17,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:04:17,425 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 03:04:17,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-22 03:04:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:04:17,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-22 03:04:17,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:04:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 19 proven. 737 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:04:23,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:04:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 3 proven. 743 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:04:38,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:04:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211640090] [2023-12-22 03:04:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211640090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:04:38,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:04:38,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-12-22 03:04:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711062450] [2023-12-22 03:04:38,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:04:38,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-22 03:04:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:04:38,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-22 03:04:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2023-12-22 03:04:38,217 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 50 states, 50 states have (on average 3.4) internal successors, (170), 50 states have internal predecessors, (170), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Received shutdown request... [2023-12-22 03:05:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-12-22 03:05:22,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=2536, Invalid=5474, Unknown=0, NotChecked=0, Total=8010 [2023-12-22 03:05:22,805 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1335 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-12-22 03:05:22,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1983 Invalid, 3153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2023-12-22 03:05:22,806 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 03:05:22,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-22 03:05:22,829 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 03:05:22,831 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 03:05:23,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:05:23,011 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (135states) and FLOYD_HOARE automaton (currently 66 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. [2023-12-22 03:05:23,012 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 03:05:23,014 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:05:23,016 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 03:05:23,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:05:23 BoogieIcfgContainer [2023-12-22 03:05:23,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 03:05:23,017 INFO L158 Benchmark]: Toolchain (without parser) took 885952.88ms. Allocated memory is still 275.8MB. Free memory was 225.1MB in the beginning and 180.5MB in the end (delta: 44.6MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 210.8MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.07ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 209.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.68ms. Allocated memory is still 275.8MB. Free memory was 209.7MB in the beginning and 207.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: Boogie Preprocessor took 34.37ms. Allocated memory is still 275.8MB. Free memory was 207.6MB in the beginning and 205.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: RCFGBuilder took 4665.71ms. Allocated memory is still 275.8MB. Free memory was 204.8MB in the beginning and 187.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,018 INFO L158 Benchmark]: TraceAbstraction took 880943.63ms. Allocated memory is still 275.8MB. Free memory was 186.3MB in the beginning and 180.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2023-12-22 03:05:23,019 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 210.8MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.07ms. Allocated memory is still 275.8MB. Free memory was 224.7MB in the beginning and 209.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.68ms. Allocated memory is still 275.8MB. Free memory was 209.7MB in the beginning and 207.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.37ms. Allocated memory is still 275.8MB. Free memory was 207.6MB in the beginning and 205.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4665.71ms. Allocated memory is still 275.8MB. Free memory was 204.8MB in the beginning and 187.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 880943.63ms. Allocated memory is still 275.8MB. Free memory was 186.3MB in the beginning and 180.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 60). Cancelled while NwaCegarLoop was constructing difference of abstraction (135states) and FLOYD_HOARE automaton (currently 66 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 48). Cancelled while NwaCegarLoop was constructing difference of abstraction (135states) and FLOYD_HOARE automaton (currently 66 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 90 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 880.9s, OverallIterations: 16, TraceHistogramMax: 23, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 107.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2913 SdHoareTripleChecker+Valid, 67.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2913 mSDsluCounter, 6857 SdHoareTripleChecker+Invalid, 65.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 136 IncrementalHoareTripleChecker+Unchecked, 5915 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7664 IncrementalHoareTripleChecker+Invalid, 7989 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 942 mSDtfsCounter, 7664 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1524 GetRequests, 1227 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 83.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=15, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 340 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 628.9s SatisfiabilityAnalysisTime, 140.6s InterpolantComputationTime, 864 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1303 ConstructedInterpolants, 2 QuantifiedInterpolants, 5785 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1366 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 1380/3904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown