/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 12:15:41,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 12:15:41,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 12:15:41,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 12:15:41,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 12:15:41,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 12:15:41,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 12:15:41,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 12:15:41,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 12:15:41,590 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 12:15:41,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 12:15:41,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 12:15:41,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 12:15:41,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 12:15:41,591 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 12:15:41,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 12:15:41,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 12:15:41,591 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 12:15:41,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 12:15:41,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 12:15:41,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 12:15:41,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 12:15:41,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 12:15:41,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 12:15:41,597 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 12:15:41,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 12:15:41,597 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 12:15:41,597 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 12:15:41,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 12:15:41,598 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 12:15:41,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 12:15:41,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 12:15:41,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 12:15:41,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 12:15:41,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 12:15:41,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 12:15:41,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 12:15:41,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 12:15:41,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 12:15:41,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 12:15:41,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 12:15:41,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 12:15:41,603 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 12:15:41,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 12:15:41,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 12:15:41,603 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 12:15:41,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-23 12:15:41,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 12:15:41,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 12:15:41,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 12:15:41,829 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 12:15:41,829 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 12:15:41,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i [2023-12-23 12:15:42,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 12:15:43,048 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 12:15:43,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i [2023-12-23 12:15:43,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f2779b3/8aab2614c6b6427f998ba86e37efaf8b/FLAG1df139863 [2023-12-23 12:15:43,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f2779b3/8aab2614c6b6427f998ba86e37efaf8b [2023-12-23 12:15:43,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 12:15:43,080 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 12:15:43,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 12:15:43,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 12:15:43,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 12:15:43,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318dbb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43, skipping insertion in model container [2023-12-23 12:15:43,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,126 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 12:15:43,237 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i[919,932] [2023-12-23 12:15:43,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 12:15:43,315 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 12:15:43,335 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i[919,932] [2023-12-23 12:15:43,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 12:15:43,378 INFO L206 MainTranslator]: Completed translation [2023-12-23 12:15:43,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43 WrapperNode [2023-12-23 12:15:43,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 12:15:43,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 12:15:43,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 12:15:43,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 12:15:43,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,430 INFO L138 Inliner]: procedures = 27, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 272 [2023-12-23 12:15:43,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 12:15:43,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 12:15:43,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 12:15:43,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 12:15:43,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-23 12:15:43,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 12:15:43,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 12:15:43,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 12:15:43,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 12:15:43,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (1/1) ... [2023-12-23 12:15:43,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 12:15:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 12:15:43,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-23 12:15:43,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-23 12:15:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 12:15:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 12:15:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 12:15:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 12:15:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 12:15:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 12:15:43,627 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 12:15:43,630 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 12:15:45,686 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 12:15:45,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 12:15:45,743 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 12:15:45,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:15:45 BoogieIcfgContainer [2023-12-23 12:15:45,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 12:15:45,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 12:15:45,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 12:15:45,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 12:15:45,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 12:15:43" (1/3) ... [2023-12-23 12:15:45,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fedc302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:15:45, skipping insertion in model container [2023-12-23 12:15:45,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 12:15:43" (2/3) ... [2023-12-23 12:15:45,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fedc302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 12:15:45, skipping insertion in model container [2023-12-23 12:15:45,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 12:15:45" (3/3) ... [2023-12-23 12:15:45,773 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-67.i [2023-12-23 12:15:45,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 12:15:45,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 12:15:45,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 12:15:45,827 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d0ff859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 12:15:45,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 12:15:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 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) [2023-12-23 12:15:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-23 12:15:45,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 12:15:45,858 INFO L195 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] [2023-12-23 12:15:45,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 12:15:45,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 12:15:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash -119816482, now seen corresponding path program 1 times [2023-12-23 12:15:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 12:15:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157407924] [2023-12-23 12:15:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 12:15:45,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 12:15:45,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 12:15:45,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-23 12:15:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 12:15:46,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 12:15:46,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 12:15:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2330 proven. 0 refuted. 0 times theorem prover too weak. 2570 trivial. 0 not checked. [2023-12-23 12:15:46,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 12:15:46,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 12:15:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157407924] [2023-12-23 12:15:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157407924] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 12:15:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 12:15:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 12:15:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744969462] [2023-12-23 12:15:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 12:15:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 12:15:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 12:15:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 12:15:46,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 12:15:46,430 INFO L87 Difference]: Start difference. First operand has 118 states, 65 states have (on average 1.4) internal successors, (91), 66 states have internal predecessors, (91), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2023-12-23 12:15:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 12:15:47,360 INFO L93 Difference]: Finished difference Result 233 states and 430 transitions. [2023-12-23 12:15:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 12:15:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 297 [2023-12-23 12:15:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 12:15:47,394 INFO L225 Difference]: With dead ends: 233 [2023-12-23 12:15:47,394 INFO L226 Difference]: Without dead ends: 116 [2023-12-23 12:15:47,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 12:15:47,399 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-23 12:15:47,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-23 12:15:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-23 12:15:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-12-23 12:15:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 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) [2023-12-23 12:15:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 186 transitions. [2023-12-23 12:15:47,436 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 186 transitions. Word has length 297 [2023-12-23 12:15:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 12:15:47,436 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 186 transitions. [2023-12-23 12:15:47,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2023-12-23 12:15:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 186 transitions. [2023-12-23 12:15:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-12-23 12:15:47,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 12:15:47,441 INFO L195 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] [2023-12-23 12:15:47,461 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 (2)] Forceful destruction successful, exit code 0 [2023-12-23 12:15:47,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:47,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 12:15:47,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 12:15:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 509516838, now seen corresponding path program 1 times [2023-12-23 12:15:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 12:15:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612313024] [2023-12-23 12:15:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 12:15:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 12:15:47,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 12:15:47,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-23 12:15:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 12:15:48,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-23 12:15:48,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 12:15:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2023-12-23 12:15:48,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 12:15:48,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 12:15:48,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612313024] [2023-12-23 12:15:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612313024] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 12:15:48,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 12:15:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 12:15:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757674531] [2023-12-23 12:15:48,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 12:15:48,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 12:15:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 12:15:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 12:15:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-23 12:15:48,998 INFO L87 Difference]: Start difference. First operand 116 states and 186 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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) [2023-12-23 12:15:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 12:15:50,961 INFO L93 Difference]: Finished difference Result 347 states and 557 transitions. [2023-12-23 12:15:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 12:15:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 297 [2023-12-23 12:15:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 12:15:50,992 INFO L225 Difference]: With dead ends: 347 [2023-12-23 12:15:50,992 INFO L226 Difference]: Without dead ends: 232 [2023-12-23 12:15:50,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-23 12:15:50,994 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 101 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-23 12:15:50,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 538 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-23 12:15:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-23 12:15:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 206. [2023-12-23 12:15:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 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) [2023-12-23 12:15:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 328 transitions. [2023-12-23 12:15:51,048 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 328 transitions. Word has length 297 [2023-12-23 12:15:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 12:15:51,049 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 328 transitions. [2023-12-23 12:15:51,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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) [2023-12-23 12:15:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 328 transitions. [2023-12-23 12:15:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-12-23 12:15:51,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 12:15:51,055 INFO L195 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] [2023-12-23 12:15:51,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-23 12:15:51,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:51,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 12:15:51,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 12:15:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 247074928, now seen corresponding path program 1 times [2023-12-23 12:15:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 12:15:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186046404] [2023-12-23 12:15:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 12:15:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 12:15:51,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 12:15:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 12:15:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 12:15:51,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 12:15:51,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 12:15:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2023-12-23 12:15:52,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 12:15:52,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 12:15:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186046404] [2023-12-23 12:15:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186046404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 12:15:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 12:15:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 12:15:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154010161] [2023-12-23 12:15:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 12:15:52,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 12:15:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 12:15:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 12:15:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 12:15:52,468 INFO L87 Difference]: Start difference. First operand 206 states and 328 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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) [2023-12-23 12:15:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 12:15:53,461 INFO L93 Difference]: Finished difference Result 440 states and 703 transitions. [2023-12-23 12:15:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 12:15:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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 299 [2023-12-23 12:15:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 12:15:53,465 INFO L225 Difference]: With dead ends: 440 [2023-12-23 12:15:53,465 INFO L226 Difference]: Without dead ends: 325 [2023-12-23 12:15:53,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 12:15:53,467 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-23 12:15:53,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 359 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-23 12:15:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-23 12:15:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2023-12-23 12:15:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 169 states have internal predecessors, (216), 150 states have call successors, (150), 3 states have call predecessors, (150), 3 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2023-12-23 12:15:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 516 transitions. [2023-12-23 12:15:53,500 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 516 transitions. Word has length 299 [2023-12-23 12:15:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 12:15:53,501 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 516 transitions. [2023-12-23 12:15:53,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 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) [2023-12-23 12:15:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 516 transitions. [2023-12-23 12:15:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-12-23 12:15:53,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 12:15:53,503 INFO L195 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] [2023-12-23 12:15:53,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-23 12:15:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:53,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 12:15:53,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 12:15:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1056421554, now seen corresponding path program 1 times [2023-12-23 12:15:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 12:15:53,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373745974] [2023-12-23 12:15:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 12:15:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 12:15:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 12:15:53,720 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 12:15:53,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 12:15:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 12:15:54,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-23 12:15:54,152 INFO L285 TraceCheckSpWp]: Computing forward predicates...