/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 WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-8.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:28:50,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:28:50,837 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-05 23:28:50,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:28:50,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:28:50,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:28:50,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:28:50,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:28:50,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:28:50,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:28:50,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:28:50,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:28:50,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:28:50,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:28:50,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:28:50,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:28:50,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:28:50,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:28:50,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:28:50,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:28:50,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:28:50,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:28:50,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:28:50,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:28:50,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:28:50,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:28:50,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:28:50,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:28:50,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:28:50,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:28:50,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:28:50,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:28:50,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:28:50,877 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:28:50,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:28:50,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:28:50,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:28:50,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:28:50,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:28:50,880 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 -> WOLF [2024-11-05 23:28:51,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:28:51,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:28:51,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:28:51,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:28:51,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:28:51,111 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-8.i [2024-11-05 23:28:52,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:28:52,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:28:52,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-8.i [2024-11-05 23:28:52,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086aa7570/e5e0c88140084ecb925a608e6d0d81f2/FLAGf28e97188 [2024-11-05 23:28:53,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086aa7570/e5e0c88140084ecb925a608e6d0d81f2 [2024-11-05 23:28:53,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:28:53,191 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:28:53,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:28:53,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:28:53,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:28:53,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50dff768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53, skipping insertion in model container [2024-11-05 23:28:53,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:28:53,399 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-8.i[915,928] [2024-11-05 23:28:53,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:28:53,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:28:53,573 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-8.i[915,928] [2024-11-05 23:28:53,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:28:53,659 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:28:53,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53 WrapperNode [2024-11-05 23:28:53,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:28:53,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:28:53,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:28:53,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:28:53,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,722 INFO L138 Inliner]: procedures = 27, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 336 [2024-11-05 23:28:53,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:28:53,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:28:53,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:28:53,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:28:53,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,756 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-05 23:28:53,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:28:53,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:28:53,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:28:53,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:28:53,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (1/1) ... [2024-11-05 23:28:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:28:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:28:53,830 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-05 23:28:53,833 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-05 23:28:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:28:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:28:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:28:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:28:53,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:28:53,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:28:54,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:28:54,012 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:28:59,455 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-05 23:28:59,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:28:59,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:28:59,480 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:28:59,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:28:59 BoogieIcfgContainer [2024-11-05 23:28:59,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:28:59,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:28:59,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:28:59,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:28:59,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:28:53" (1/3) ... [2024-11-05 23:28:59,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5a40ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:28:59, skipping insertion in model container [2024-11-05 23:28:59,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:28:53" (2/3) ... [2024-11-05 23:28:59,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5a40ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:28:59, skipping insertion in model container [2024-11-05 23:28:59,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:28:59" (3/3) ... [2024-11-05 23:28:59,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-8.i [2024-11-05 23:28:59,505 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:28:59,505 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:28:59,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:28:59,583 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;@51e269ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:28:59,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:28:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 102 states have internal predecessors, (153), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-05 23:28:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:28:59,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:28:59,614 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:28:59,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:28:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:28:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1272070780, now seen corresponding path program 1 times [2024-11-05 23:28:59,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:28:59,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337613876] [2024-11-05 23:28:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:28:59,635 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-05 23:28:59,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:28:59,639 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-05 23:28:59,641 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-05 23:29:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:00,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:29:00,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2024-11-05 23:29:00,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:29:00,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:29:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337613876] [2024-11-05 23:29:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337613876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:29:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:29:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:29:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475791655] [2024-11-05 23:29:00,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:29:00,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:29:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:29:00,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:29:00,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:29:00,351 INFO L87 Difference]: Start difference. First operand has 154 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 102 states have internal predecessors, (153), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-05 23:29:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:29:00,385 INFO L93 Difference]: Finished difference Result 301 states and 550 transitions. [2024-11-05 23:29:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:29:00,393 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, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 322 [2024-11-05 23:29:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:29:00,404 INFO L225 Difference]: With dead ends: 301 [2024-11-05 23:29:00,405 INFO L226 Difference]: Without dead ends: 150 [2024-11-05 23:29:00,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 321 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-05 23:29:00,413 INFO L432 NwaCegarLoop]: 246 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, 246 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-05 23:29:00,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:29:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-05 23:29:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-05 23:29:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-05 23:29:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 246 transitions. [2024-11-05 23:29:00,541 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 246 transitions. Word has length 322 [2024-11-05 23:29:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:29:00,541 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 246 transitions. [2024-11-05 23:29:00,542 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, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-05 23:29:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 246 transitions. [2024-11-05 23:29:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:29:00,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:29:00,548 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:29:00,573 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-05 23:29:00,749 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-05 23:29:00,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:29:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:29:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 963929796, now seen corresponding path program 1 times [2024-11-05 23:29:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:29:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499143912] [2024-11-05 23:29:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:00,752 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-05 23:29:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:29:00,754 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-05 23:29:00,756 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-05 23:29:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:01,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 23:29:01,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-05 23:29:01,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:29:01,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:29:01,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499143912] [2024-11-05 23:29:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499143912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:29:01,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:29:01,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-05 23:29:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329468376] [2024-11-05 23:29:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:29:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 23:29:01,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:29:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 23:29:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:29:01,473 INFO L87 Difference]: Start difference. First operand 150 states and 246 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-05 23:29:05,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:07,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:29:07,313 INFO L93 Difference]: Finished difference Result 431 states and 706 transitions. [2024-11-05 23:29:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 23:29:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 322 [2024-11-05 23:29:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:29:07,318 INFO L225 Difference]: With dead ends: 431 [2024-11-05 23:29:07,318 INFO L226 Difference]: Without dead ends: 284 [2024-11-05 23:29:07,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:29:07,320 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 211 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-05 23:29:07,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 623 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-05 23:29:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-05 23:29:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-11-05 23:29:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 179 states have (on average 1.3966480446927374) internal successors, (250), 179 states have internal predecessors, (250), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-05 23:29:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 450 transitions. [2024-11-05 23:29:07,366 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 450 transitions. Word has length 322 [2024-11-05 23:29:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:29:07,369 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 450 transitions. [2024-11-05 23:29:07,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-05 23:29:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 450 transitions. [2024-11-05 23:29:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:29:07,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:29:07,376 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:29:07,395 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-05 23:29:07,577 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-05 23:29:07,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:29:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:29:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -215528324, now seen corresponding path program 1 times [2024-11-05 23:29:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:29:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941355699] [2024-11-05 23:29:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:07,579 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-05 23:29:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:29:07,584 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-05 23:29:07,585 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-05 23:29:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:08,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 23:29:08,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-05 23:29:10,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:29:10,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:29:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941355699] [2024-11-05 23:29:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941355699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:29:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:29:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:29:10,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048298777] [2024-11-05 23:29:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:29:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 23:29:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:29:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 23:29:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:29:10,373 INFO L87 Difference]: Start difference. First operand 282 states and 450 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-05 23:29:13,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:16,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:29:16,986 INFO L93 Difference]: Finished difference Result 837 states and 1340 transitions. [2024-11-05 23:29:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 23:29:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 322 [2024-11-05 23:29:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:29:17,043 INFO L225 Difference]: With dead ends: 837 [2024-11-05 23:29:17,043 INFO L226 Difference]: Without dead ends: 558 [2024-11-05 23:29:17,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 23:29:17,054 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 80 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-05 23:29:17,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 444 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-05 23:29:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-05 23:29:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 546. [2024-11-05 23:29:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 341 states have (on average 1.3929618768328447) internal successors, (475), 341 states have internal predecessors, (475), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-05 23:29:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 875 transitions. [2024-11-05 23:29:17,147 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 875 transitions. Word has length 322 [2024-11-05 23:29:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:29:17,148 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 875 transitions. [2024-11-05 23:29:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-05 23:29:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 875 transitions. [2024-11-05 23:29:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:29:17,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:29:17,152 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:29:17,174 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-05 23:29:17,356 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-05 23:29:17,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:29:17,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:29:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 207173502, now seen corresponding path program 1 times [2024-11-05 23:29:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:29:17,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423061184] [2024-11-05 23:29:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:17,359 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-05 23:29:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:29:17,363 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-05 23:29:17,365 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-05 23:29:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:17,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 23:29:17,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1985 proven. 210 refuted. 0 times theorem prover too weak. 2705 trivial. 0 not checked. [2024-11-05 23:29:23,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:29:24,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:29:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423061184] [2024-11-05 23:29:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423061184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:29:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2020382982] [2024-11-05 23:29:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:29:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:29:24,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:29:24,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-05 23:29:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:25,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 23:29:25,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1947 proven. 108 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2024-11-05 23:29:28,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:29:29,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2020382982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:29:29,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:29:29,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2024-11-05 23:29:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182436322] [2024-11-05 23:29:29,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:29:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:29:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:29:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:29:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:29:29,311 INFO L87 Difference]: Start difference. First operand 546 states and 875 transitions. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2024-11-05 23:29:33,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:35,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:29:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:29:35,446 INFO L93 Difference]: Finished difference Result 1120 states and 1776 transitions. [2024-11-05 23:29:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 23:29:35,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) Word has length 322 [2024-11-05 23:29:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:29:35,452 INFO L225 Difference]: With dead ends: 1120 [2024-11-05 23:29:35,452 INFO L226 Difference]: Without dead ends: 577 [2024-11-05 23:29:35,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-05 23:29:35,454 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 184 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-05 23:29:35,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 924 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-05 23:29:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-05 23:29:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 562. [2024-11-05 23:29:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 353 states have (on average 1.3711048158640227) internal successors, (484), 353 states have internal predecessors, (484), 200 states have call successors, (200), 8 states have call predecessors, (200), 8 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-11-05 23:29:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 884 transitions. [2024-11-05 23:29:35,492 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 884 transitions. Word has length 322 [2024-11-05 23:29:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:29:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 884 transitions. [2024-11-05 23:29:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2024-11-05 23:29:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 884 transitions. [2024-11-05 23:29:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:29:35,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:29:35,495 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:29:35,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 23:29:35,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-05 23:29:35,895 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-05 23:29:35,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:29:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:29:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1786971204, now seen corresponding path program 1 times [2024-11-05 23:29:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:29:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181224885] [2024-11-05 23:29:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:35,900 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-05 23:29:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:29:35,902 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-05 23:29:35,903 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-05 23:29:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:36,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:29:36,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2443 proven. 84 refuted. 0 times theorem prover too weak. 2373 trivial. 0 not checked. [2024-11-05 23:29:40,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:29:43,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:29:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181224885] [2024-11-05 23:29:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181224885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:29:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682881624] [2024-11-05 23:29:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:29:43,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:29:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:29:43,119 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:29:43,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-05 23:29:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:29:47,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 23:29:47,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:29:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2473 proven. 162 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2024-11-05 23:29:55,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:30:00,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [682881624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:30:00,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:30:00,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-05 23:30:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906729398] [2024-11-05 23:30:00,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:30:00,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 23:30:00,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:30:00,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 23:30:00,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2024-11-05 23:30:00,734 INFO L87 Difference]: Start difference. First operand 562 states and 884 transitions. Second operand has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 5 states have call successors, (100), 5 states have call predecessors, (100), 7 states have return successors, (100), 5 states have call predecessors, (100), 5 states have call successors, (100) [2024-11-05 23:30:12,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:30:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 23:30:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:30:19,207 INFO L93 Difference]: Finished difference Result 2212 states and 3431 transitions. [2024-11-05 23:30:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-05 23:30:19,211 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 5 states have call successors, (100), 5 states have call predecessors, (100), 7 states have return successors, (100), 5 states have call predecessors, (100), 5 states have call successors, (100) Word has length 322 [2024-11-05 23:30:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:30:19,219 INFO L225 Difference]: With dead ends: 2212 [2024-11-05 23:30:19,219 INFO L226 Difference]: Without dead ends: 1653 [2024-11-05 23:30:19,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2024-11-05 23:30:19,221 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 701 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:30:19,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1734 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1461 Invalid, 1 Unknown, 0 Unchecked, 16.4s Time] [2024-11-05 23:30:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-11-05 23:30:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1613. [2024-11-05 23:30:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1054 states have (on average 1.381404174573055) internal successors, (1456), 1060 states have internal predecessors, (1456), 526 states have call successors, (526), 32 states have call predecessors, (526), 32 states have return successors, (526), 520 states have call predecessors, (526), 526 states have call successors, (526) [2024-11-05 23:30:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2508 transitions. [2024-11-05 23:30:19,348 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2508 transitions. Word has length 322 [2024-11-05 23:30:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:30:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2508 transitions. [2024-11-05 23:30:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 15 states have internal predecessors, (144), 5 states have call successors, (100), 5 states have call predecessors, (100), 7 states have return successors, (100), 5 states have call predecessors, (100), 5 states have call successors, (100) [2024-11-05 23:30:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2508 transitions. [2024-11-05 23:30:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-11-05 23:30:19,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:30:19,355 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:30:19,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 23:30:19,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-05 23:30:19,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-05 23:30:19,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:30:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:30:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash 136256830, now seen corresponding path program 1 times [2024-11-05 23:30:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:30:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904114706] [2024-11-05 23:30:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:30:19,758 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-05 23:30:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:30:19,760 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 23:30:19,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 23:30:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:30:20,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 23:30:20,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:30:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2473 proven. 162 refuted. 0 times theorem prover too weak. 2265 trivial. 0 not checked. [2024-11-05 23:30:25,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:30:26,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:30:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904114706] [2024-11-05 23:30:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904114706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:30:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1727676838] [2024-11-05 23:30:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:30:26,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:30:26,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:30:26,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:30:26,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-05 23:30:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:30:30,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-05 23:30:30,228 INFO L278 TraceCheckSpWp]: Computing forward predicates...