/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-96.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:31:01,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:31:01,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 08:31:01,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:31:01,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:31:01,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:31:01,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:31:01,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:31:01,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:31:01,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:31:01,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:31:01,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:31:01,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:31:01,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:31:01,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:31:01,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:31:01,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:31:01,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:31:01,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:31:01,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:31:01,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:31:01,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:31:01,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:31:01,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:31:01,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:31:01,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:31:01,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:31:01,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:31:01,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:31:01,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:31:01,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:31:01,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:31:01,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:31:01,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:31:01,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:31:01,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:31:01,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:31:01,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:31:01,914 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:31:01,914 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:31:01,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:31:01,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:31:01,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:31:01,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:31:01,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FOX [2024-11-06 08:31:02,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:31:02,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:31:02,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:31:02,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:31:02,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:31:02,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-96.i [2024-11-06 08:31:03,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:31:03,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:31:03,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-96.i [2024-11-06 08:31:03,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cc33220/291f94f05f1243c69b97b196f4214680/FLAGbb3c985c4 [2024-11-06 08:31:03,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51cc33220/291f94f05f1243c69b97b196f4214680 [2024-11-06 08:31:03,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:31:03,825 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:31:03,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:31:03,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:31:03,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:31:03,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:03" (1/1) ... [2024-11-06 08:31:03,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516fde56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:03, skipping insertion in model container [2024-11-06 08:31:03,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:03" (1/1) ... [2024-11-06 08:31:03,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:31:04,040 WARN L250 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_operatoramount_amount250_file-96.i[916,929] [2024-11-06 08:31:04,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:31:04,186 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:31:04,203 WARN L250 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_operatoramount_amount250_file-96.i[916,929] [2024-11-06 08:31:04,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:31:04,314 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:31:04,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04 WrapperNode [2024-11-06 08:31:04,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:31:04,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:31:04,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:31:04,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:31:04,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,421 INFO L138 Inliner]: procedures = 27, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 332 [2024-11-06 08:31:04,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:31:04,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:31:04,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:31:04,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:31:04,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 08:31:04,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:31:04,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:31:04,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:31:04,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:31:04,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (1/1) ... [2024-11-06 08:31:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:31:04,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:31:04,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 08:31:04,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 08:31:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:31:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:31:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:31:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:31:04,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:31:04,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:31:04,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:31:04,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:31:26,607 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-06 08:31:26,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:31:26,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:31:26,623 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:31:26,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:26 BoogieIcfgContainer [2024-11-06 08:31:26,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:31:26,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:31:26,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:31:26,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:31:26,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:31:03" (1/3) ... [2024-11-06 08:31:26,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:26, skipping insertion in model container [2024-11-06 08:31:26,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:04" (2/3) ... [2024-11-06 08:31:26,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561d3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:26, skipping insertion in model container [2024-11-06 08:31:26,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:26" (3/3) ... [2024-11-06 08:31:26,631 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-96.i [2024-11-06 08:31:26,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:31:26,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:31:26,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:31:26,716 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68935ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:31:26,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:31:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-06 08:31:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-06 08:31:26,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:31:26,741 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:31:26,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:31:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:31:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1881766993, now seen corresponding path program 1 times [2024-11-06 08:31:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:31:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540035416] [2024-11-06 08:31:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:31:26,760 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 [2024-11-06 08:31:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:31:26,763 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) [2024-11-06 08:31:26,764 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 [2024-11-06 08:31:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:31:27,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:31:27,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:31:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2024-11-06 08:31:27,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:31:28,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:31:28,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540035416] [2024-11-06 08:31:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540035416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:31:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:31:28,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:31:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423713111] [2024-11-06 08:31:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:31:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:31:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:31:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:31:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:31:28,025 INFO L87 Difference]: Start difference. First operand has 135 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-06 08:31:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:31:28,058 INFO L93 Difference]: Finished difference Result 263 states and 460 transitions. [2024-11-06 08:31:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:31:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 262 [2024-11-06 08:31:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:31:28,073 INFO L225 Difference]: With dead ends: 263 [2024-11-06 08:31:28,073 INFO L226 Difference]: Without dead ends: 131 [2024-11-06 08:31:28,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:31:28,082 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 08:31:28,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:31:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-06 08:31:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-06 08:31:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-06 08:31:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-06 08:31:28,124 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 262 [2024-11-06 08:31:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:31:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-06 08:31:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-06 08:31:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-06 08:31:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-06 08:31:28,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:31:28,129 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:31:28,171 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 [2024-11-06 08:31:28,330 WARN L453 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 [2024-11-06 08:31:28,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:31:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:31:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -382927513, now seen corresponding path program 1 times [2024-11-06 08:31:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:31:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785536301] [2024-11-06 08:31:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:31:28,333 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 [2024-11-06 08:31:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:31:28,335 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) [2024-11-06 08:31:28,338 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 [2024-11-06 08:31:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:31:29,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 08:31:29,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:31:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1387 proven. 66 refuted. 0 times theorem prover too weak. 1359 trivial. 0 not checked. [2024-11-06 08:31:35,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:31:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-11-06 08:31:39,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:31:39,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785536301] [2024-11-06 08:31:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785536301] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 08:31:39,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 08:31:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-06 08:31:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456344731] [2024-11-06 08:31:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:31:39,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 08:31:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:31:39,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 08:31:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 08:31:39,048 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-11-06 08:31:41,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:31:49,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:31:53,278 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 [] [2024-11-06 08:31:57,284 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 [] [2024-11-06 08:32:01,289 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 [] [2024-11-06 08:32:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:32:02,163 INFO L93 Difference]: Finished difference Result 341 states and 534 transitions. [2024-11-06 08:32:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 08:32:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 262 [2024-11-06 08:32:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:32:02,167 INFO L225 Difference]: With dead ends: 341 [2024-11-06 08:32:02,167 INFO L226 Difference]: Without dead ends: 213 [2024-11-06 08:32:02,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-06 08:32:02,169 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 123 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2024-11-06 08:32:02,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 603 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 4 Unknown, 0 Unchecked, 22.9s Time] [2024-11-06 08:32:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-06 08:32:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2024-11-06 08:32:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4516129032258065) internal successors, (225), 156 states have internal predecessors, (225), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-06 08:32:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 329 transitions. [2024-11-06 08:32:02,194 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 329 transitions. Word has length 262 [2024-11-06 08:32:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:32:02,195 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 329 transitions. [2024-11-06 08:32:02,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-11-06 08:32:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 329 transitions. [2024-11-06 08:32:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-06 08:32:02,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:32:02,204 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:32:02,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 08:32:02,408 WARN L453 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 [2024-11-06 08:32:02,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:32:02,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:32:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1226933015, now seen corresponding path program 1 times [2024-11-06 08:32:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:32:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367645750] [2024-11-06 08:32:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:32:02,411 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 [2024-11-06 08:32:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:32:02,417 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) [2024-11-06 08:32:02,419 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 [2024-11-06 08:32:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:32:03,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:32:03,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:32:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1137 proven. 81 refuted. 0 times theorem prover too weak. 1594 trivial. 0 not checked. [2024-11-06 08:32:10,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:32:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 30 proven. 81 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-11-06 08:32:17,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:32:17,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367645750] [2024-11-06 08:32:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367645750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:32:17,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:32:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-06 08:32:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566181284] [2024-11-06 08:32:17,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:32:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 08:32:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:32:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 08:32:17,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-06 08:32:17,020 INFO L87 Difference]: Start difference. First operand 210 states and 329 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 3 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2024-11-06 08:32:29,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 08:32:33,609 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 [0] [2024-11-06 08:32:37,614 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 [0] [2024-11-06 08:32:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:32:44,458 INFO L93 Difference]: Finished difference Result 522 states and 806 transitions. [2024-11-06 08:32:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 08:32:44,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 3 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) Word has length 262 [2024-11-06 08:32:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:32:44,469 INFO L225 Difference]: With dead ends: 522 [2024-11-06 08:32:44,469 INFO L226 Difference]: Without dead ends: 315 [2024-11-06 08:32:44,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2024-11-06 08:32:44,478 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 355 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 176 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-06 08:32:44,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 623 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 498 Invalid, 3 Unknown, 0 Unchecked, 24.3s Time] [2024-11-06 08:32:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-06 08:32:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 218. [2024-11-06 08:32:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 162 states have internal predecessors, (229), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-06 08:32:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 333 transitions. [2024-11-06 08:32:44,549 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 333 transitions. Word has length 262 [2024-11-06 08:32:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:32:44,555 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 333 transitions. [2024-11-06 08:32:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 3 states have call successors, (65), 2 states have call predecessors, (65), 4 states have return successors, (66), 3 states have call predecessors, (66), 3 states have call successors, (66) [2024-11-06 08:32:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 333 transitions. [2024-11-06 08:32:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-06 08:32:44,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:32:44,559 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 08:32:44,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 08:32:44,766 WARN L453 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 [2024-11-06 08:32:44,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:32:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:32:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1424052817, now seen corresponding path program 1 times [2024-11-06 08:32:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:32:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546845882] [2024-11-06 08:32:44,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:32:44,770 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 [2024-11-06 08:32:44,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:32:44,778 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) [2024-11-06 08:32:44,785 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 [2024-11-06 08:32:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:32:46,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:32:46,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:32:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-11-06 08:32:47,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:32:47,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:32:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546845882] [2024-11-06 08:32:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546845882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:32:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:32:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 08:32:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916628749] [2024-11-06 08:32:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:32:47,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 08:32:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:32:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 08:32:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 08:32:47,065 INFO L87 Difference]: Start difference. First operand 218 states and 333 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38)