/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:49:03,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:49:03,222 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 19:49:03,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:49:03,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:49:03,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:49:03,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:49:03,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:49:03,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:49:03,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:49:03,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:49:03,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:49:03,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:49:03,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:49:03,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:49:03,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:49:03,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:49:03,252 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:49:03,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:49:03,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:49:03,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:49:03,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:49:03,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:49:03,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:49:03,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:49:03,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:49:03,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:49:03,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:49:03,259 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:49:03,259 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:49:03,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:49:03,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:49:03,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:49:03,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:49:03,260 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 19:49:03,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:49:03,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:49:03,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:49:03,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:49:03,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:49:03,447 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-9.i [2024-11-05 19:49:04,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:49:04,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:49:04,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-9.i [2024-11-05 19:49:04,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6f23a66/6dd7d62db12444ca84cc3adbb81461c1/FLAGbb1d3cc9e [2024-11-05 19:49:05,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6f23a66/6dd7d62db12444ca84cc3adbb81461c1 [2024-11-05 19:49:05,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:49:05,192 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:49:05,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:49:05,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:49:05,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:49:05,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49642398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05, skipping insertion in model container [2024-11-05 19:49:05,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:49:05,364 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-9.i[915,928] [2024-11-05 19:49:05,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:49:05,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:49:05,503 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-9.i[915,928] [2024-11-05 19:49:05,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:49:05,583 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:49:05,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05 WrapperNode [2024-11-05 19:49:05,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:49:05,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:49:05,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:49:05,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:49:05,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,630 INFO L138 Inliner]: procedures = 27, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 351 [2024-11-05 19:49:05,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:49:05,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:49:05,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:49:05,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:49:05,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,665 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 19:49:05,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:49:05,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:49:05,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:49:05,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:49:05,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (1/1) ... [2024-11-05 19:49:05,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:49:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:49:05,747 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 19:49:05,751 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 19:49:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:49:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:49:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:49:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:49:05,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:49:05,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:49:05,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:49:05,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:49:27,365 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-05 19:49:27,365 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:49:27,379 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:49:27,380 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:49:27,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:49:27 BoogieIcfgContainer [2024-11-05 19:49:27,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:49:27,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:49:27,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:49:27,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:49:27,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:49:05" (1/3) ... [2024-11-05 19:49:27,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f173a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:49:27, skipping insertion in model container [2024-11-05 19:49:27,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:05" (2/3) ... [2024-11-05 19:49:27,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f173a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:49:27, skipping insertion in model container [2024-11-05 19:49:27,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:49:27" (3/3) ... [2024-11-05 19:49:27,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-9.i [2024-11-05 19:49:27,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:49:27,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:49:27,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:49:27,458 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;@72ec4b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:49:27,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:49:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 103 states have internal predecessors, (154), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-05 19:49:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-05 19:49:27,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:27,476 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:49:27,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 835048000, now seen corresponding path program 1 times [2024-11-05 19:49:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426659350] [2024-11-05 19:49:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:27,491 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 19:49:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:27,494 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 19:49:27,494 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 19:49:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:28,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:49:28,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1678 proven. 0 refuted. 0 times theorem prover too weak. 2834 trivial. 0 not checked. [2024-11-05 19:49:28,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2024-11-05 19:49:33,886 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1426659350] [2024-11-05 19:49:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1426659350] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:49:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:49:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:49:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975429310] [2024-11-05 19:49:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:49:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:49:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:49:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:49:33,910 INFO L87 Difference]: Start difference. First operand has 153 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 103 states have internal predecessors, (154), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-05 19:49:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:49:33,941 INFO L93 Difference]: Finished difference Result 299 states and 542 transitions. [2024-11-05 19:49:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:49:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 308 [2024-11-05 19:49:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:49:33,950 INFO L225 Difference]: With dead ends: 299 [2024-11-05 19:49:33,950 INFO L226 Difference]: Without dead ends: 149 [2024-11-05 19:49:33,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 614 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 19:49:33,960 INFO L432 NwaCegarLoop]: 243 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, 243 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 19:49:33,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:49:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-05 19:49:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-05 19:49:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 99 states have internal predecessors, (147), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-05 19:49:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 243 transitions. [2024-11-05 19:49:34,011 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 243 transitions. Word has length 308 [2024-11-05 19:49:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:49:34,011 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 243 transitions. [2024-11-05 19:49:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-05 19:49:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 243 transitions. [2024-11-05 19:49:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-05 19:49:34,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:34,016 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:49:34,056 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 19:49:34,216 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 19:49:34,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1843529460, now seen corresponding path program 1 times [2024-11-05 19:49:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:34,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532440810] [2024-11-05 19:49:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:34,219 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 19:49:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:34,220 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 19:49:34,221 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 19:49:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:35,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 19:49:35,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-05 19:49:49,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-05 19:49:58,792 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:58,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532440810] [2024-11-05 19:49:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1532440810] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:49:58,793 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:49:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 4 [2024-11-05 19:49:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576721852] [2024-11-05 19:49:58,793 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:49:58,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:49:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:49:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:49:58,797 INFO L87 Difference]: Start difference. First operand 149 states and 243 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2024-11-05 19:50:04,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:09,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:13,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:18,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:22,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:27,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:31,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:50:31,775 INFO L93 Difference]: Finished difference Result 516 states and 846 transitions. [2024-11-05 19:50:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 19:50:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 308 [2024-11-05 19:50:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:50:31,780 INFO L225 Difference]: With dead ends: 516 [2024-11-05 19:50:31,780 INFO L226 Difference]: Without dead ends: 370 [2024-11-05 19:50:31,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 19:50:31,782 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 374 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 103 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2024-11-05 19:50:31,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 779 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 32.8s Time] [2024-11-05 19:50:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-05 19:50:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 290. [2024-11-05 19:50:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 191 states have internal predecessors, (281), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-05 19:50:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 473 transitions. [2024-11-05 19:50:31,841 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 473 transitions. Word has length 308 [2024-11-05 19:50:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:50:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 473 transitions. [2024-11-05 19:50:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2024-11-05 19:50:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 473 transitions. [2024-11-05 19:50:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-05 19:50:31,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:50:31,871 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:31,914 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 [2024-11-05 19:50:32,072 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 19:50:32,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:50:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:50:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1076902019, now seen corresponding path program 1 times [2024-11-05 19:50:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:50:32,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861302063] [2024-11-05 19:50:32,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:50:32,074 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 19:50:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:50:32,075 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 19:50:32,076 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 19:50:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:50:33,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:50:33,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:50:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1601 proven. 30 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2024-11-05 19:50:38,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:50:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 111 proven. 30 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2024-11-05 19:50:46,637 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:50:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861302063] [2024-11-05 19:50:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1861302063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:50:46,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:50:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:50:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204344691] [2024-11-05 19:50:46,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:50:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:50:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:50:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:50:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:50:46,640 INFO L87 Difference]: Start difference. First operand 290 states and 473 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)