/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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 11:47:52,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 11:47:52,842 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-23 11:47:52,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 11:47:52,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 11:47:52,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 11:47:52,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 11:47:52,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 11:47:52,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 11:47:52,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 11:47:52,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 11:47:52,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 11:47:52,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 11:47:52,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 11:47:52,881 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 11:47:52,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 11:47:52,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 11:47:52,881 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 11:47:52,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 11:47:52,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 11:47:52,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 11:47:52,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 11:47:52,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 11:47:52,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 11:47:52,884 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 11:47:52,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 11:47:52,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 11:47:52,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 11:47:52,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:47:52,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 11:47:52,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 11:47:52,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 11:47:52,887 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 11:47:52,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 11:47:52,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 11:47:52,887 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 11:47:52,887 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-23 11:47:53,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 11:47:53,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 11:47:53,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 11:47:53,114 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 11:47:53,114 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 11:47:53,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i [2023-12-23 11:47:54,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 11:47:54,331 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 11:47:54,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i [2023-12-23 11:47:54,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a436edce4/20b4ffeaceeb45459a8cdab51da44907/FLAG095269d4e [2023-12-23 11:47:54,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a436edce4/20b4ffeaceeb45459a8cdab51da44907 [2023-12-23 11:47:54,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 11:47:54,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 11:47:54,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 11:47:54,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 11:47:54,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 11:47:54,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9c75cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54, skipping insertion in model container [2023-12-23 11:47:54,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 11:47:54,496 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i[919,932] [2023-12-23 11:47:54,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:47:54,552 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 11:47:54,560 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i[919,932] [2023-12-23 11:47:54,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 11:47:54,602 INFO L206 MainTranslator]: Completed translation [2023-12-23 11:47:54,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54 WrapperNode [2023-12-23 11:47:54,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 11:47:54,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 11:47:54,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 11:47:54,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 11:47:54,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,654 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2023-12-23 11:47:54,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 11:47:54,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 11:47:54,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 11:47:54,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 11:47:54,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,694 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-23 11:47:54,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 11:47:54,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 11:47:54,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 11:47:54,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 11:47:54,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (1/1) ... [2023-12-23 11:47:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 11:47:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 11:47:54,756 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-23 11:47:54,759 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-23 11:47:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 11:47:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 11:47:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 11:47:54,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 11:47:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 11:47:54,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 11:47:54,877 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 11:47:54,878 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 11:48:20,510 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 11:48:20,553 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 11:48:20,553 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 11:48:20,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:48:20 BoogieIcfgContainer [2023-12-23 11:48:20,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 11:48:20,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 11:48:20,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 11:48:20,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 11:48:20,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 11:47:54" (1/3) ... [2023-12-23 11:48:20,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec2115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:48:20, skipping insertion in model container [2023-12-23 11:48:20,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 11:47:54" (2/3) ... [2023-12-23 11:48:20,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ec2115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 11:48:20, skipping insertion in model container [2023-12-23 11:48:20,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 11:48:20" (3/3) ... [2023-12-23 11:48:20,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-30.i [2023-12-23 11:48:20,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 11:48:20,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 11:48:20,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 11:48:20,625 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;@338ceb3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 11:48:20,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 11:48:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:48:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-23 11:48:20,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:48:20,650 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:48:20,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:48:20,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:48:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 855508986, now seen corresponding path program 1 times [2023-12-23 11:48:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:48:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940146426] [2023-12-23 11:48:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:48:20,668 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-23 11:48:20,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:48:20,670 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-23 11:48:20,732 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-23 11:48:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:48:22,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 11:48:22,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:48:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 892 proven. 0 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-12-23 11:48:22,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:48:22,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:48:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940146426] [2023-12-23 11:48:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940146426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:48:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:48:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 11:48:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34777525] [2023-12-23 11:48:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:48:22,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 11:48:22,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:48:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 11:48:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 11:48:22,318 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-23 11:48:26,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:48:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:48:26,556 INFO L93 Difference]: Finished difference Result 191 states and 345 transitions. [2023-12-23 11:48:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 11:48:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 210 [2023-12-23 11:48:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:48:26,621 INFO L225 Difference]: With dead ends: 191 [2023-12-23 11:48:26,621 INFO L226 Difference]: Without dead ends: 95 [2023-12-23 11:48:26,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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-23 11:48:26,625 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-23 11:48:26,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-23 11:48:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-23 11:48:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-23 11:48:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-23 11:48:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2023-12-23 11:48:26,665 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 210 [2023-12-23 11:48:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:48:26,665 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2023-12-23 11:48:26,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-23 11:48:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2023-12-23 11:48:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-23 11:48:26,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:48:26,669 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:48:26,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-23 11:48:26,891 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-23 11:48:26,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:48:26,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:48:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 287002500, now seen corresponding path program 1 times [2023-12-23 11:48:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:48:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959507891] [2023-12-23 11:48:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:48:26,893 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-23 11:48:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:48:26,898 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-23 11:48:26,899 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-23 11:48:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:48:28,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 11:48:28,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:48:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:48:30,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:48:30,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:48:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959507891] [2023-12-23 11:48:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959507891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:48:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:48:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 11:48:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148604299] [2023-12-23 11:48:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:48:30,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 11:48:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:48:30,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 11:48:30,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-23 11:48:30,637 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:48:35,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:48:39,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:48:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:48:39,936 INFO L93 Difference]: Finished difference Result 313 states and 505 transitions. [2023-12-23 11:48:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 11:48:39,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2023-12-23 11:48:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:48:40,002 INFO L225 Difference]: With dead ends: 313 [2023-12-23 11:48:40,002 INFO L226 Difference]: Without dead ends: 219 [2023-12-23 11:48:40,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-23 11:48:40,004 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 139 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-23 11:48:40,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 482 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2023-12-23 11:48:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-23 11:48:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 187. [2023-12-23 11:48:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-23 11:48:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 299 transitions. [2023-12-23 11:48:40,051 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 299 transitions. Word has length 210 [2023-12-23 11:48:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:48:40,052 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 299 transitions. [2023-12-23 11:48:40,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:48:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 299 transitions. [2023-12-23 11:48:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-23 11:48:40,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:48:40,055 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:48:40,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-23 11:48:40,268 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-23 11:48:40,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:48:40,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:48:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1577160791, now seen corresponding path program 1 times [2023-12-23 11:48:40,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:48:40,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873782708] [2023-12-23 11:48:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:48:40,271 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-23 11:48:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:48:40,272 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-23 11:48:40,277 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-23 11:48:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:48:41,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 11:48:41,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:48:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 66 proven. 186 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2023-12-23 11:48:46,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 11:48:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2023-12-23 11:48:48,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:48:48,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873782708] [2023-12-23 11:48:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873782708] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 11:48:48,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 11:48:48,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-23 11:48:48,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33543034] [2023-12-23 11:48:48,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 11:48:48,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 11:48:48,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:48:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 11:48:48,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-23 11:48:48,410 INFO L87 Difference]: Start difference. First operand 187 states and 299 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2023-12-23 11:48:55,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:48:59,394 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-23 11:49:03,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:05,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:49:05,241 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2023-12-23 11:49:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-23 11:49:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) Word has length 211 [2023-12-23 11:49:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:49:05,243 INFO L225 Difference]: With dead ends: 302 [2023-12-23 11:49:05,244 INFO L226 Difference]: Without dead ends: 208 [2023-12-23 11:49:05,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2023-12-23 11:49:05,245 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 298 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 74 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2023-12-23 11:49:05,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 339 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 276 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2023-12-23 11:49:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-23 11:49:05,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 203. [2023-12-23 11:49:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-23 11:49:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 309 transitions. [2023-12-23 11:49:05,265 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 309 transitions. Word has length 211 [2023-12-23 11:49:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:49:05,266 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 309 transitions. [2023-12-23 11:49:05,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 3 states have call successors, (65), 3 states have call predecessors, (65), 5 states have return successors, (66), 2 states have call predecessors, (66), 3 states have call successors, (66) [2023-12-23 11:49:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 309 transitions. [2023-12-23 11:49:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-23 11:49:05,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:49:05,268 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:49:05,293 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 (4)] Forceful destruction successful, exit code 0 [2023-12-23 11:49:05,487 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-23 11:49:05,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:49:05,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:49:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1657567355, now seen corresponding path program 1 times [2023-12-23 11:49:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:49:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483981188] [2023-12-23 11:49:05,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:49:05,489 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-23 11:49:05,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:49:05,490 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-23 11:49:05,492 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-23 11:49:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:49:06,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 11:49:06,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:49:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:49:06,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:49:06,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:49:06,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483981188] [2023-12-23 11:49:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483981188] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:49:06,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:49:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 11:49:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486269677] [2023-12-23 11:49:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:49:06,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 11:49:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:49:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 11:49:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 11:49:06,896 INFO L87 Difference]: Start difference. First operand 203 states and 309 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:49:11,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:15,239 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-23 11:49:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:49:15,321 INFO L93 Difference]: Finished difference Result 405 states and 617 transitions. [2023-12-23 11:49:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 11:49:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2023-12-23 11:49:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:49:15,323 INFO L225 Difference]: With dead ends: 405 [2023-12-23 11:49:15,323 INFO L226 Difference]: Without dead ends: 203 [2023-12-23 11:49:15,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 11:49:15,325 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 34 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-23 11:49:15,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 246 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2023-12-23 11:49:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-23 11:49:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-12-23 11:49:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 130 states have internal predecessors, (175), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-23 11:49:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2023-12-23 11:49:15,353 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 212 [2023-12-23 11:49:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:49:15,353 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2023-12-23 11:49:15,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:49:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2023-12-23 11:49:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-23 11:49:15,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:49:15,355 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:49:15,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-23 11:49:15,580 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-23 11:49:15,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:49:15,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:49:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1838094164, now seen corresponding path program 1 times [2023-12-23 11:49:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:49:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563453377] [2023-12-23 11:49:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:49:15,582 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-23 11:49:15,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:49:15,583 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-23 11:49:15,583 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-23 11:49:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:49:16,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 11:49:16,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:49:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:49:17,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:49:17,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:49:17,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563453377] [2023-12-23 11:49:17,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563453377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:49:17,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:49:17,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 11:49:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214421078] [2023-12-23 11:49:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:49:17,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 11:49:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:49:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 11:49:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 11:49:17,253 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:49:21,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:25,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:29,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:32,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:49:33,059 INFO L93 Difference]: Finished difference Result 627 states and 949 transitions. [2023-12-23 11:49:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 11:49:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2023-12-23 11:49:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:49:33,063 INFO L225 Difference]: With dead ends: 627 [2023-12-23 11:49:33,063 INFO L226 Difference]: Without dead ends: 425 [2023-12-23 11:49:33,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 11:49:33,066 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 208 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 68 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-12-23 11:49:33,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 427 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2023-12-23 11:49:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-12-23 11:49:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 403. [2023-12-23 11:49:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 258 states have (on average 1.3333333333333333) internal successors, (344), 258 states have internal predecessors, (344), 132 states have call successors, (132), 12 states have call predecessors, (132), 12 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2023-12-23 11:49:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 608 transitions. [2023-12-23 11:49:33,096 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 608 transitions. Word has length 213 [2023-12-23 11:49:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:49:33,097 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 608 transitions. [2023-12-23 11:49:33,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:49:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 608 transitions. [2023-12-23 11:49:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-23 11:49:33,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:49:33,099 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:49:33,125 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-23 11:49:33,320 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-23 11:49:33,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:49:33,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:49:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2056948882, now seen corresponding path program 1 times [2023-12-23 11:49:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:49:33,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502849902] [2023-12-23 11:49:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:49:33,322 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-23 11:49:33,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:49:33,323 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-23 11:49:33,324 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-23 11:49:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:49:34,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 11:49:34,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:49:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2023-12-23 11:49:37,397 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 11:49:37,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 11:49:37,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502849902] [2023-12-23 11:49:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502849902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 11:49:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 11:49:37,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 11:49:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210472553] [2023-12-23 11:49:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 11:49:37,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 11:49:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 11:49:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 11:49:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 11:49:37,398 INFO L87 Difference]: Start difference. First operand 403 states and 608 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:49:42,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:46,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:50,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:54,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:49:59,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:50:03,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:50:04,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 11:50:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 11:50:04,996 INFO L93 Difference]: Finished difference Result 896 states and 1346 transitions. [2023-12-23 11:50:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 11:50:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2023-12-23 11:50:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 11:50:04,999 INFO L225 Difference]: With dead ends: 896 [2023-12-23 11:50:04,999 INFO L226 Difference]: Without dead ends: 494 [2023-12-23 11:50:05,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-23 11:50:05,001 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 148 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2023-12-23 11:50:05,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 528 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 27.5s Time] [2023-12-23 11:50:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-23 11:50:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 203. [2023-12-23 11:50:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 130 states have internal predecessors, (171), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2023-12-23 11:50:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 303 transitions. [2023-12-23 11:50:05,039 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 303 transitions. Word has length 213 [2023-12-23 11:50:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 11:50:05,039 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 303 transitions. [2023-12-23 11:50:05,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2023-12-23 11:50:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2023-12-23 11:50:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-23 11:50:05,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 11:50:05,041 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 11:50:05,070 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 (7)] Forceful destruction successful, exit code 0 [2023-12-23 11:50:05,261 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-23 11:50:05,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 11:50:05,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 11:50:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2037384978, now seen corresponding path program 1 times [2023-12-23 11:50:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 11:50:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404402516] [2023-12-23 11:50:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 11:50:05,262 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-23 11:50:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 11:50:05,264 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-23 11:50:05,265 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-23 11:50:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 11:50:06,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-23 11:50:06,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 11:51:21,566 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 11:52:29,765 WARN L293 SmtUtils]: Spent 13.82s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 11:52:37,993 WARN L293 SmtUtils]: Spent 8.19s 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-23 11:52:46,183 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:52:54,321 WARN L293 SmtUtils]: Spent 8.14s 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-23 11:53:02,494 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:09,356 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:17,559 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:25,752 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:33,953 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:41,256 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:53:49,462 WARN L293 SmtUtils]: Spent 8.21s 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-23 11:54:00,684 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:54:08,893 WARN L293 SmtUtils]: Spent 8.21s 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-23 11:54:15,674 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:54:26,481 WARN L293 SmtUtils]: Spent 8.01s 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-23 11:54:34,686 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:54:42,879 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:54:51,075 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:54:59,284 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:55:07,484 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:55:14,120 WARN L293 SmtUtils]: Spent 6.64s 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-23 11:55:22,320 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:55:30,518 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:55:37,976 WARN L293 SmtUtils]: Spent 7.46s 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-23 11:55:46,180 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 11:55:54,379 WARN L293 SmtUtils]: Spent 8.20s 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-23 11:55:59,645 WARN L293 SmtUtils]: Spent 5.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-23 11:56:03,709 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0))) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1)))) (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0))))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse2 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse2 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse2) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse7 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse5 (bvsgt .cse7 c_~var_1_14~0)) (.cse3 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse4 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse3 .cse4) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse4)))) (not .cse5)) (and .cse5 (let ((.cse6 (bvslt c_~last_1_var_1_15~0 .cse7))) (or (and (not .cse6) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse3 .cse6)))))))) is different from false [2023-12-23 11:56:07,755 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0))) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1)))) (and (fp.geq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0))))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse2 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse2 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse2) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse7 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse5 (bvsgt .cse7 c_~var_1_14~0)) (.cse3 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse4 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse3 .cse4) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse4)))) (not .cse5)) (and .cse5 (let ((.cse6 (bvslt c_~last_1_var_1_15~0 .cse7))) (or (and (not .cse6) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse3 .cse6)))))))) is different from true