/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_fillercodesize_ps-cn-100_file-98.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 00:52:55,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 00:52:55,877 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 00:52:55,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 00:52:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 00:52:55,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 00:52:55,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 00:52:55,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 00:52:55,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 00:52:55,909 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 00:52:55,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 00:52:55,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 00:52:55,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 00:52:55,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 00:52:55,911 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 00:52:55,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 00:52:55,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 00:52:55,912 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 00:52:55,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 00:52:55,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 00:52:55,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 00:52:55,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 00:52:55,914 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 00:52:55,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 00:52:55,914 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 00:52:55,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 00:52:55,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 00:52:55,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 00:52:55,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 00:52:55,917 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 00:52:55,917 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 00:52:56,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 00:52:56,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 00:52:56,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 00:52:56,112 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 00:52:56,112 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 00:52:56,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2023-12-23 00:52:57,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 00:52:57,341 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 00:52:57,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2023-12-23 00:52:57,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4788127/1e1085bd7edb49c7aac4c072525e60cb/FLAG03f0cb371 [2023-12-23 00:52:57,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df4788127/1e1085bd7edb49c7aac4c072525e60cb [2023-12-23 00:52:57,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 00:52:57,371 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 00:52:57,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 00:52:57,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 00:52:57,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 00:52:57,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fd6bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57, skipping insertion in model container [2023-12-23 00:52:57,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,416 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 00:52:57,523 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_fillercodesize_ps-cn-100_file-98.i[916,929] [2023-12-23 00:52:57,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 00:52:57,598 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 00:52:57,606 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_fillercodesize_ps-cn-100_file-98.i[916,929] [2023-12-23 00:52:57,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 00:52:57,652 INFO L206 MainTranslator]: Completed translation [2023-12-23 00:52:57,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57 WrapperNode [2023-12-23 00:52:57,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 00:52:57,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 00:52:57,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 00:52:57,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 00:52:57,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,698 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2023-12-23 00:52:57,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 00:52:57,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 00:52:57,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 00:52:57,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 00:52:57,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,735 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 00:52:57,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 00:52:57,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 00:52:57,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 00:52:57,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 00:52:57,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (1/1) ... [2023-12-23 00:52:57,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 00:52:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 00:52:57,816 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 00:52:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 00:52:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 00:52:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 00:52:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 00:52:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 00:52:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 00:52:57,831 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 00:52:57,944 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 00:52:57,946 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 00:53:00,972 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 00:53:01,028 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 00:53:01,029 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 00:53:01,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:53:01 BoogieIcfgContainer [2023-12-23 00:53:01,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 00:53:01,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 00:53:01,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 00:53:01,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 00:53:01,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 12:52:57" (1/3) ... [2023-12-23 00:53:01,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b147bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:53:01, skipping insertion in model container [2023-12-23 00:53:01,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:52:57" (2/3) ... [2023-12-23 00:53:01,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b147bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:53:01, skipping insertion in model container [2023-12-23 00:53:01,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:53:01" (3/3) ... [2023-12-23 00:53:01,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-98.i [2023-12-23 00:53:01,049 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 00:53:01,049 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 00:53:01,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 00:53:01,100 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;@731940c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 00:53:01,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 00:53:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-23 00:53:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-23 00:53:01,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:01,143 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:01,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:01,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash -680046862, now seen corresponding path program 1 times [2023-12-23 00:53:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599582426] [2023-12-23 00:53:01,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:01,166 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 00:53:01,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:01,168 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 00:53:01,172 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 00:53:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:01,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 00:53:01,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:53:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 4468 trivial. 0 not checked. [2023-12-23 00:53:01,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:53:01,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:53:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599582426] [2023-12-23 00:53:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599582426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:53:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:53:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 00:53:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952560386] [2023-12-23 00:53:01,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:53:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 00:53:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:53:01,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 00:53:01,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 00:53:01,941 INFO L87 Difference]: Start difference. First operand has 125 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 00:53:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:53:02,409 INFO L93 Difference]: Finished difference Result 247 states and 465 transitions. [2023-12-23 00:53:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 00:53:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 319 [2023-12-23 00:53:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:53:02,437 INFO L225 Difference]: With dead ends: 247 [2023-12-23 00:53:02,437 INFO L226 Difference]: Without dead ends: 123 [2023-12-23 00:53:02,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 318 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 00:53:02,443 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-23 00:53:02,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-23 00:53:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-23 00:53:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-12-23 00:53:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-23 00:53:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 202 transitions. [2023-12-23 00:53:02,484 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 202 transitions. Word has length 319 [2023-12-23 00:53:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:53:02,485 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 202 transitions. [2023-12-23 00:53:02,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (53), 2 states have call predecessors, (53), 2 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-23 00:53:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 202 transitions. [2023-12-23 00:53:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2023-12-23 00:53:02,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:02,490 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:02,510 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 00:53:02,704 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 00:53:02,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:02,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1484952308, now seen corresponding path program 1 times [2023-12-23 00:53:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541097891] [2023-12-23 00:53:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:02,707 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 00:53:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:02,708 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 00:53:02,709 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 00:53:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:03,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 00:53:03,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:53:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-12-23 00:53:03,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:53:03,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:53:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541097891] [2023-12-23 00:53:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541097891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:53:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:53:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 00:53:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141016053] [2023-12-23 00:53:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:53:03,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 00:53:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:53:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 00:53:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 00:53:03,312 INFO L87 Difference]: Start difference. First operand 123 states and 202 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:53:04,788 INFO L93 Difference]: Finished difference Result 334 states and 549 transitions. [2023-12-23 00:53:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 00:53:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 319 [2023-12-23 00:53:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:53:04,792 INFO L225 Difference]: With dead ends: 334 [2023-12-23 00:53:04,792 INFO L226 Difference]: Without dead ends: 212 [2023-12-23 00:53:04,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 317 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 00:53:04,794 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-23 00:53:04,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 472 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-23 00:53:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-23 00:53:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2023-12-23 00:53:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 120 states have internal predecessors, (171), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-23 00:53:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 345 transitions. [2023-12-23 00:53:04,824 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 345 transitions. Word has length 319 [2023-12-23 00:53:04,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:53:04,825 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 345 transitions. [2023-12-23 00:53:04,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:04,825 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 345 transitions. [2023-12-23 00:53:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2023-12-23 00:53:04,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:04,829 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:04,847 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 00:53:05,040 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 00:53:05,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:05,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1477314100, now seen corresponding path program 1 times [2023-12-23 00:53:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115971659] [2023-12-23 00:53:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:05,042 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 00:53:05,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:05,043 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 00:53:05,045 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 00:53:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:05,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 00:53:05,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:53:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-12-23 00:53:05,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:53:05,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:53:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115971659] [2023-12-23 00:53:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115971659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:53:05,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:53:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 00:53:05,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992881208] [2023-12-23 00:53:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:53:05,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 00:53:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:53:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 00:53:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 00:53:05,654 INFO L87 Difference]: Start difference. First operand 209 states and 345 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:53:06,214 INFO L93 Difference]: Finished difference Result 542 states and 900 transitions. [2023-12-23 00:53:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 00:53:06,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 320 [2023-12-23 00:53:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:53:06,219 INFO L225 Difference]: With dead ends: 542 [2023-12-23 00:53:06,219 INFO L226 Difference]: Without dead ends: 334 [2023-12-23 00:53:06,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 318 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 00:53:06,221 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 198 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-23 00:53:06,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 544 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-23 00:53:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-23 00:53:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2023-12-23 00:53:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 120 states have internal predecessors, (169), 87 states have call successors, (87), 2 states have call predecessors, (87), 2 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-23 00:53:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 343 transitions. [2023-12-23 00:53:06,248 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 343 transitions. Word has length 320 [2023-12-23 00:53:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:53:06,249 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 343 transitions. [2023-12-23 00:53:06,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 343 transitions. [2023-12-23 00:53:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2023-12-23 00:53:06,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:06,252 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:06,276 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 00:53:06,468 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 00:53:06,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:06,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2137594826, now seen corresponding path program 1 times [2023-12-23 00:53:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:06,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124009865] [2023-12-23 00:53:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:06,470 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 00:53:06,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:06,471 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 00:53:06,499 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 00:53:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:06,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 00:53:06,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:53:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-12-23 00:53:07,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:53:07,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:53:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124009865] [2023-12-23 00:53:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124009865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:53:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:53:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 00:53:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275763120] [2023-12-23 00:53:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:53:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 00:53:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:53:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 00:53:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-23 00:53:07,046 INFO L87 Difference]: Start difference. First operand 209 states and 343 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:53:08,373 INFO L93 Difference]: Finished difference Result 750 states and 1238 transitions. [2023-12-23 00:53:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 00:53:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 320 [2023-12-23 00:53:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:53:08,381 INFO L225 Difference]: With dead ends: 750 [2023-12-23 00:53:08,383 INFO L226 Difference]: Without dead ends: 542 [2023-12-23 00:53:08,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-23 00:53:08,387 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 369 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-23 00:53:08,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 911 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-23 00:53:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-12-23 00:53:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 411. [2023-12-23 00:53:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 232 states have (on average 1.4137931034482758) internal successors, (328), 234 states have internal predecessors, (328), 174 states have call successors, (174), 4 states have call predecessors, (174), 4 states have return successors, (174), 172 states have call predecessors, (174), 174 states have call successors, (174) [2023-12-23 00:53:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 676 transitions. [2023-12-23 00:53:08,456 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 676 transitions. Word has length 320 [2023-12-23 00:53:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:53:08,457 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 676 transitions. [2023-12-23 00:53:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 676 transitions. [2023-12-23 00:53:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2023-12-23 00:53:08,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:08,460 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:08,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-23 00:53:08,673 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 00:53:08,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:08,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2137535244, now seen corresponding path program 1 times [2023-12-23 00:53:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234139988] [2023-12-23 00:53:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:08,675 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 00:53:08,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:08,676 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 00:53:08,682 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 00:53:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:09,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 00:53:09,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 00:53:09,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2023-12-23 00:53:09,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 00:53:09,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 00:53:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234139988] [2023-12-23 00:53:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234139988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 00:53:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 00:53:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 00:53:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60026963] [2023-12-23 00:53:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 00:53:09,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 00:53:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 00:53:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 00:53:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 00:53:09,322 INFO L87 Difference]: Start difference. First operand 411 states and 676 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 00:53:09,942 INFO L93 Difference]: Finished difference Result 883 states and 1446 transitions. [2023-12-23 00:53:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 00:53:09,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 320 [2023-12-23 00:53:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 00:53:09,946 INFO L225 Difference]: With dead ends: 883 [2023-12-23 00:53:09,946 INFO L226 Difference]: Without dead ends: 473 [2023-12-23 00:53:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 318 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 00:53:09,947 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 136 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-23 00:53:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 417 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-23 00:53:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-12-23 00:53:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 472. [2023-12-23 00:53:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 256 states have (on average 1.359375) internal successors, (348), 259 states have internal predecessors, (348), 209 states have call successors, (209), 6 states have call predecessors, (209), 6 states have return successors, (209), 206 states have call predecessors, (209), 209 states have call successors, (209) [2023-12-23 00:53:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 766 transitions. [2023-12-23 00:53:09,990 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 766 transitions. Word has length 320 [2023-12-23 00:53:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 00:53:09,991 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 766 transitions. [2023-12-23 00:53:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2023-12-23 00:53:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 766 transitions. [2023-12-23 00:53:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2023-12-23 00:53:09,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 00:53:09,997 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:10,013 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 (6)] Forceful destruction successful, exit code 0 [2023-12-23 00:53:10,213 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 00:53:10,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 00:53:10,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 00:53:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1146314802, now seen corresponding path program 1 times [2023-12-23 00:53:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 00:53:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320146622] [2023-12-23 00:53:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 00:53:10,215 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 00:53:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 00:53:10,216 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 00:53:10,218 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 00:53:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 00:53:10,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-23 00:53:10,806 INFO L285 TraceCheckSpWp]: Computing forward predicates...