/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-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 08:26:27,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 08:26:27,304 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:26:27,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 08:26:27,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 08:26:27,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 08:26:27,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 08:26:27,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 08:26:27,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 08:26:27,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 08:26:27,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 08:26:27,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 08:26:27,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 08:26:27,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 08:26:27,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 08:26:27,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 08:26:27,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 08:26:27,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 08:26:27,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 08:26:27,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 08:26:27,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 08:26:27,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 08:26:27,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 08:26:27,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 08:26:27,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 08:26:27,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 08:26:27,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 08:26:27,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 08:26:27,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 08:26:27,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 08:26:27,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 08:26:27,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 08:26:27,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 08:26:27,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 08:26:27,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:26:27,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 08:26:27,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 08:26:27,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 08:26:27,352 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 08:26:27,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 08:26:27,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 08:26:27,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 08:26:27,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 08:26:27,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 08:26:27,354 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:26:27,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 08:26:27,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 08:26:27,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 08:26:27,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 08:26:27,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 08:26:27,603 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-63.i [2024-11-06 08:26:29,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 08:26:29,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 08:26:29,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-63.i [2024-11-06 08:26:29,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983abd544/130953760f0c436686ef256072b760a6/FLAG0fe53cdf9 [2024-11-06 08:26:29,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983abd544/130953760f0c436686ef256072b760a6 [2024-11-06 08:26:29,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 08:26:29,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 08:26:29,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 08:26:29,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 08:26:29,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 08:26:29,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:26:29" (1/1) ... [2024-11-06 08:26:29,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528fb274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:29, skipping insertion in model container [2024-11-06 08:26:29,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:26:29" (1/1) ... [2024-11-06 08:26:29,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 08:26:29,763 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-63.i[916,929] [2024-11-06 08:26:29,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:26:29,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 08:26:29,930 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-63.i[916,929] [2024-11-06 08:26:29,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 08:26:30,025 INFO L204 MainTranslator]: Completed translation [2024-11-06 08:26:30,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30 WrapperNode [2024-11-06 08:26:30,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 08:26:30,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 08:26:30,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 08:26:30,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 08:26:30,036 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:26:30" (1/1) ... [2024-11-06 08:26:30,052 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:26:30" (1/1) ... [2024-11-06 08:26:30,079 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 350 [2024-11-06 08:26:30,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 08:26:30,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 08:26:30,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 08:26:30,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 08:26:30,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,134 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:26:30,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,157 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 08:26:30,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 08:26:30,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 08:26:30,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 08:26:30,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (1/1) ... [2024-11-06 08:26:30,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 08:26:30,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 08:26:30,231 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:26:30,237 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:26:30,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 08:26:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 08:26:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 08:26:30,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 08:26:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 08:26:30,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 08:26:30,376 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 08:26:30,378 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 08:26:41,095 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-06 08:26:41,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 08:26:41,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 08:26:41,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 08:26:41,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:26:41 BoogieIcfgContainer [2024-11-06 08:26:41,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 08:26:41,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 08:26:41,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 08:26:41,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 08:26:41,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:26:29" (1/3) ... [2024-11-06 08:26:41,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a2f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:26:41, skipping insertion in model container [2024-11-06 08:26:41,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:26:30" (2/3) ... [2024-11-06 08:26:41,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a2f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:26:41, skipping insertion in model container [2024-11-06 08:26:41,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:26:41" (3/3) ... [2024-11-06 08:26:41,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-63.i [2024-11-06 08:26:41,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 08:26:41,144 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 08:26:41,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 08:26:41,222 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;@2ddddfaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 08:26:41,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 08:26:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 98 states have internal predecessors, (144), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-06 08:26:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:26:41,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:26:41,249 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:41,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:26:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:26:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -369639437, now seen corresponding path program 1 times [2024-11-06 08:26:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:26:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109783534] [2024-11-06 08:26:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:26:41,275 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:26:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:26:41,279 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:26:41,280 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:26:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:26:42,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 08:26:42,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:26:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1632 proven. 0 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2024-11-06 08:26:42,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:26:42,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:26:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109783534] [2024-11-06 08:26:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109783534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:26:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:26:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 08:26:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722744411] [2024-11-06 08:26:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:26:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 08:26:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:26:42,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 08:26:42,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 08:26:42,129 INFO L87 Difference]: Start difference. First operand has 147 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 98 states have internal predecessors, (144), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-06 08:26:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:26:42,169 INFO L93 Difference]: Finished difference Result 286 states and 515 transitions. [2024-11-06 08:26:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 08:26:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 306 [2024-11-06 08:26:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:26:42,180 INFO L225 Difference]: With dead ends: 286 [2024-11-06 08:26:42,180 INFO L226 Difference]: Without dead ends: 142 [2024-11-06 08:26:42,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 305 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:26:42,188 INFO L432 NwaCegarLoop]: 227 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, 227 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:26:42,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 08:26:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-06 08:26:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-06 08:26:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-06 08:26:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 227 transitions. [2024-11-06 08:26:42,243 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 227 transitions. Word has length 306 [2024-11-06 08:26:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:26:42,243 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 227 transitions. [2024-11-06 08:26:42,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-06 08:26:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 227 transitions. [2024-11-06 08:26:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:26:42,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:26:42,249 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:42,280 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:26:42,450 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:26:42,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:26:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:26:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1358618737, now seen corresponding path program 1 times [2024-11-06 08:26:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:26:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103119819] [2024-11-06 08:26:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:26:42,453 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:26:42,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:26:42,456 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:26:42,457 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:26:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:26:43,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:26:43,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:26:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1018 proven. 120 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2024-11-06 08:26:46,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:26:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-06 08:26:49,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:26:49,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103119819] [2024-11-06 08:26:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103119819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:26:49,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:26:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-06 08:26:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500818728] [2024-11-06 08:26:49,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:26:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 08:26:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:26:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 08:26:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:26:49,957 INFO L87 Difference]: Start difference. First operand 142 states and 227 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2024-11-06 08:26:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:27:00,899 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:27:04,911 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:27:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:27:04,915 INFO L93 Difference]: Finished difference Result 286 states and 454 transitions. [2024-11-06 08:27:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 08:27:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 306 [2024-11-06 08:27:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:27:04,994 INFO L225 Difference]: With dead ends: 286 [2024-11-06 08:27:04,994 INFO L226 Difference]: Without dead ends: 147 [2024-11-06 08:27:04,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 604 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-06 08:27:04,996 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 311 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 124 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-06 08:27:04,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 395 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 266 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2024-11-06 08:27:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-06 08:27:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-06 08:27:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-06 08:27:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 224 transitions. [2024-11-06 08:27:05,030 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 224 transitions. Word has length 306 [2024-11-06 08:27:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:27:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 224 transitions. [2024-11-06 08:27:05,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2024-11-06 08:27:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 224 transitions. [2024-11-06 08:27:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:27:05,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:27:05,038 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:05,063 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:27:05,241 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:27:05,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:27:05,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:27:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1019378067, now seen corresponding path program 1 times [2024-11-06 08:27:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:27:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778231020] [2024-11-06 08:27:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:27:05,244 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:27:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:27:05,245 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:27:05,247 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:27:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:27:05,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 08:27:05,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:27:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2024-11-06 08:27:10,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:27:10,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:27:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778231020] [2024-11-06 08:27:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778231020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:27:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:27:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 08:27:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163117471] [2024-11-06 08:27:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:27:10,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 08:27:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:27:10,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 08:27:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 08:27:10,550 INFO L87 Difference]: Start difference. First operand 145 states and 224 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-06 08:27:15,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:27:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:27:15,059 INFO L93 Difference]: Finished difference Result 290 states and 448 transitions. [2024-11-06 08:27:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 08:27:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 306 [2024-11-06 08:27:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:27:15,129 INFO L225 Difference]: With dead ends: 290 [2024-11-06 08:27:15,129 INFO L226 Difference]: Without dead ends: 148 [2024-11-06 08:27:15,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 08:27:15,131 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 200 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 97 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-06 08:27:15,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 220 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-06 08:27:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-06 08:27:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-06 08:27:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-06 08:27:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 221 transitions. [2024-11-06 08:27:15,159 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 221 transitions. Word has length 306 [2024-11-06 08:27:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:27:15,161 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 221 transitions. [2024-11-06 08:27:15,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-06 08:27:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 221 transitions. [2024-11-06 08:27:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:27:15,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:27:15,163 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:15,188 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 [2024-11-06 08:27:15,368 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:27:15,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:27:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:27:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 320997229, now seen corresponding path program 1 times [2024-11-06 08:27:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:27:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375142238] [2024-11-06 08:27:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:27:15,370 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:27:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:27:15,372 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:27:15,373 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:27:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:27:16,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:27:16,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:27:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2024-11-06 08:27:24,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 08:27:24,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:27:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375142238] [2024-11-06 08:27:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375142238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 08:27:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 08:27:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 08:27:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830217071] [2024-11-06 08:27:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 08:27:24,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 08:27:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:27:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 08:27:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 08:27:24,889 INFO L87 Difference]: Start difference. First operand 144 states and 221 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-06 08:27:29,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:27:33,854 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:27:38,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:27:42,134 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:27:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:27:42,135 INFO L93 Difference]: Finished difference Result 427 states and 658 transitions. [2024-11-06 08:27:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 08:27:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 306 [2024-11-06 08:27:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:27:42,205 INFO L225 Difference]: With dead ends: 427 [2024-11-06 08:27:42,205 INFO L226 Difference]: Without dead ends: 286 [2024-11-06 08:27:42,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 08:27:42,206 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 112 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 95 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-06 08:27:42,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 619 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 17.1s Time] [2024-11-06 08:27:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-06 08:27:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 242. [2024-11-06 08:27:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 143 states have internal predecessors, (181), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-06 08:27:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 369 transitions. [2024-11-06 08:27:42,260 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 369 transitions. Word has length 306 [2024-11-06 08:27:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:27:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 369 transitions. [2024-11-06 08:27:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2024-11-06 08:27:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 369 transitions. [2024-11-06 08:27:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:27:42,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:27:42,262 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:42,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-06 08:27:42,463 WARN L453 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 [2024-11-06 08:27:42,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:27:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:27:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -188475861, now seen corresponding path program 1 times [2024-11-06 08:27:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:27:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285160546] [2024-11-06 08:27:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:27:42,465 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:27:42,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:27:42,467 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) [2024-11-06 08:27:42,468 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 [2024-11-06 08:27:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:27:43,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 08:27:43,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:27:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1396 proven. 111 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2024-11-06 08:27:46,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:27:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 27 proven. 111 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-06 08:27:49,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:27:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285160546] [2024-11-06 08:27:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285160546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:27:49,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:27:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-06 08:27:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319120638] [2024-11-06 08:27:49,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:27:49,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 08:27:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:27:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 08:27:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 08:27:49,464 INFO L87 Difference]: Start difference. First operand 242 states and 369 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-06 08:27:56,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:28:00,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-06 08:28:04,138 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:28:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 08:28:04,145 INFO L93 Difference]: Finished difference Result 395 states and 593 transitions. [2024-11-06 08:28:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 08:28:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 306 [2024-11-06 08:28:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 08:28:04,213 INFO L225 Difference]: With dead ends: 395 [2024-11-06 08:28:04,214 INFO L226 Difference]: Without dead ends: 254 [2024-11-06 08:28:04,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 604 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-06 08:28:04,215 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 84 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-06 08:28:04,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 364 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2024-11-06 08:28:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-06 08:28:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2024-11-06 08:28:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 145 states have internal predecessors, (176), 94 states have call successors, (94), 6 states have call predecessors, (94), 6 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-06 08:28:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 364 transitions. [2024-11-06 08:28:04,247 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 364 transitions. Word has length 306 [2024-11-06 08:28:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 08:28:04,266 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 364 transitions. [2024-11-06 08:28:04,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2024-11-06 08:28:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 364 transitions. [2024-11-06 08:28:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 08:28:04,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 08:28:04,268 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 08:28:04,468 WARN L453 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 [2024-11-06 08:28:04,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 08:28:04,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 08:28:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1734752173, now seen corresponding path program 1 times [2024-11-06 08:28:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 08:28:04,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293404966] [2024-11-06 08:28:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 08:28:04,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 [2024-11-06 08:28:04,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 08:28:04,472 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) [2024-11-06 08:28:04,472 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 [2024-11-06 08:28:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 08:28:05,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 08:28:05,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 08:28:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1018 proven. 120 refuted. 0 times theorem prover too weak. 3186 trivial. 0 not checked. [2024-11-06 08:28:09,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 08:28:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2024-11-06 08:28:12,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 08:28:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293404966] [2024-11-06 08:28:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293404966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 08:28:12,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 08:28:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-06 08:28:12,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475067046] [2024-11-06 08:28:12,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 08:28:12,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 08:28:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 08:28:12,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 08:28:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 08:28:12,466 INFO L87 Difference]: Start difference. First operand 246 states and 364 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88)