/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_amount50_file-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 20:18:55,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 20:18:55,882 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 20:18:55,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 20:18:55,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 20:18:55,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 20:18:55,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 20:18:55,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 20:18:55,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 20:18:55,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 20:18:55,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 20:18:55,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 20:18:55,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 20:18:55,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 20:18:55,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 20:18:55,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 20:18:55,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 20:18:55,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 20:18:55,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 20:18:55,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 20:18:55,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 20:18:55,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 20:18:55,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 20:18:55,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 20:18:55,933 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 20:18:55,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 20:18:55,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 20:18:55,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 20:18:55,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 20:18:55,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 20:18:55,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 20:18:55,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 20:18:55,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 20:18:55,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 20:18:55,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:18:55,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 20:18:55,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 20:18:55,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 20:18:55,936 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 20:18:55,936 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 20:18:55,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 20:18:55,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 20:18:55,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 20:18:55,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 20:18:55,937 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 20:18:56,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 20:18:56,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 20:18:56,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 20:18:56,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 20:18:56,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 20:18:56,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-05 20:18:57,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 20:18:57,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 20:18:57,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-05 20:18:57,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e310266/26e26fa38fef403eaefdb28246b8a8a8/FLAG590d474ae [2024-11-05 20:18:58,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e310266/26e26fa38fef403eaefdb28246b8a8a8 [2024-11-05 20:18:58,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 20:18:58,229 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 20:18:58,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 20:18:58,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 20:18:58,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 20:18:58,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff44242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58, skipping insertion in model container [2024-11-05 20:18:58,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 20:18:58,430 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_amount50_file-34.i[915,928] [2024-11-05 20:18:58,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:18:58,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 20:18:58,494 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_amount50_file-34.i[915,928] [2024-11-05 20:18:58,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 20:18:58,541 INFO L204 MainTranslator]: Completed translation [2024-11-05 20:18:58,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58 WrapperNode [2024-11-05 20:18:58,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 20:18:58,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 20:18:58,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 20:18:58,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 20:18:58,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,595 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-05 20:18:58,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 20:18:58,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 20:18:58,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 20:18:58,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 20:18:58,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,630 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 20:18:58,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 20:18:58,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 20:18:58,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 20:18:58,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 20:18:58,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (1/1) ... [2024-11-05 20:18:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 20:18:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 20:18:58,683 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 20:18:58,686 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 20:18:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 20:18:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 20:18:58,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 20:18:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 20:18:58,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 20:18:58,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 20:18:58,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 20:18:58,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 20:18:59,248 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-05 20:18:59,249 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 20:18:59,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 20:18:59,263 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 20:18:59,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:59 BoogieIcfgContainer [2024-11-05 20:18:59,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 20:18:59,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 20:18:59,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 20:18:59,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 20:18:59,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:18:58" (1/3) ... [2024-11-05 20:18:59,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d58be13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:59, skipping insertion in model container [2024-11-05 20:18:59,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58" (2/3) ... [2024-11-05 20:18:59,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d58be13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:59, skipping insertion in model container [2024-11-05 20:18:59,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:59" (3/3) ... [2024-11-05 20:18:59,271 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-34.i [2024-11-05 20:18:59,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 20:18:59,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 20:18:59,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 20:18:59,371 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;@88afbb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 20:18:59,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 20:18:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-05 20:18:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-05 20:18:59,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:18:59,387 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:59,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:18:59,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:18:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash 945974761, now seen corresponding path program 1 times [2024-11-05 20:18:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:18:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633852954] [2024-11-05 20:18:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:18:59,403 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 20:18:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:18:59,405 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 20:18:59,406 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 20:18:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:18:59,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 20:18:59,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:18:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 20:18:59,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:18:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-05 20:18:59,717 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:18:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633852954] [2024-11-05 20:18:59,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [633852954] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 20:18:59,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 20:18:59,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 20:18:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401031737] [2024-11-05 20:18:59,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 20:18:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 20:18:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:18:59,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 20:18:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 20:18:59,741 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 20:18:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:18:59,765 INFO L93 Difference]: Finished difference Result 97 states and 163 transitions. [2024-11-05 20:18:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 20:18:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-05 20:18:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:18:59,775 INFO L225 Difference]: With dead ends: 97 [2024-11-05 20:18:59,776 INFO L226 Difference]: Without dead ends: 48 [2024-11-05 20:18:59,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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 20:18:59,782 INFO L432 NwaCegarLoop]: 71 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, 71 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 20:18:59,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 20:18:59,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-05 20:18:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-05 20:18:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-05 20:18:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-11-05 20:18:59,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 90 [2024-11-05 20:18:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:18:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-11-05 20:18:59,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 20:18:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-11-05 20:18:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-05 20:18:59,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:18:59,821 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:59,828 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 20:19:00,022 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 20:19:00,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:00,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2128279915, now seen corresponding path program 1 times [2024-11-05 20:19:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055344965] [2024-11-05 20:19:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:00,025 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 20:19:00,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:00,026 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 20:19:00,028 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 20:19:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:00,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:19:00,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-05 20:19:00,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-05 20:19:00,543 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055344965] [2024-11-05 20:19:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1055344965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 20:19:00,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 20:19:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-05 20:19:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882433868] [2024-11-05 20:19:00,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 20:19:00,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 20:19:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 20:19:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 20:19:00,548 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 20:19:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:01,064 INFO L93 Difference]: Finished difference Result 150 states and 217 transitions. [2024-11-05 20:19:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 20:19:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 90 [2024-11-05 20:19:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:01,068 INFO L225 Difference]: With dead ends: 150 [2024-11-05 20:19:01,069 INFO L226 Difference]: Without dead ends: 105 [2024-11-05 20:19:01,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-05 20:19:01,071 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 186 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:01,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 228 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 20:19:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-05 20:19:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2024-11-05 20:19:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-05 20:19:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-05 20:19:01,108 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 90 [2024-11-05 20:19:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-05 20:19:01,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 20:19:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-05 20:19:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-05 20:19:01,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:01,114 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:01,123 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 20:19:01,315 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 20:19:01,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1908521943, now seen corresponding path program 1 times [2024-11-05 20:19:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:01,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394839564] [2024-11-05 20:19:01,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:01,317 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 20:19:01,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:01,320 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 20:19:01,322 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 20:19:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:01,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 20:19:01,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 20:19:01,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 20:19:01,793 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394839564] [2024-11-05 20:19:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [394839564] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:19:01,794 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:19:01,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2024-11-05 20:19:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786163045] [2024-11-05 20:19:01,794 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:19:01,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 20:19:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 20:19:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 20:19:01,798 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 20:19:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:02,010 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-05 20:19:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 20:19:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 90 [2024-11-05 20:19:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:02,019 INFO L225 Difference]: With dead ends: 232 [2024-11-05 20:19:02,019 INFO L226 Difference]: Without dead ends: 136 [2024-11-05 20:19:02,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 20:19:02,025 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 159 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:02,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 234 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 20:19:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-05 20:19:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 101. [2024-11-05 20:19:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-05 20:19:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-05 20:19:02,052 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 90 [2024-11-05 20:19:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-05 20:19:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 20:19:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-05 20:19:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-05 20:19:02,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:02,061 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:02,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 20:19:02,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:02,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:02,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1568566816, now seen corresponding path program 1 times [2024-11-05 20:19:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1030689697] [2024-11-05 20:19:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:02,264 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 20:19:02,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:02,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 20:19:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:02,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 20:19:02,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 20:19:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 20:19:02,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 20:19:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-05 20:19:03,001 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 20:19:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1030689697] [2024-11-05 20:19:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1030689697] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 20:19:03,002 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 20:19:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2024-11-05 20:19:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728360753] [2024-11-05 20:19:03,002 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 20:19:03,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 20:19:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 20:19:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 20:19:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-05 20:19:03,004 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 20:19:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 20:19:03,726 INFO L93 Difference]: Finished difference Result 428 states and 605 transitions. [2024-11-05 20:19:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 20:19:03,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 91 [2024-11-05 20:19:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 20:19:03,730 INFO L225 Difference]: With dead ends: 428 [2024-11-05 20:19:03,730 INFO L226 Difference]: Without dead ends: 330 [2024-11-05 20:19:03,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-05 20:19:03,733 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 134 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 20:19:03,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 413 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 20:19:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-05 20:19:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 105. [2024-11-05 20:19:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 74 states have internal predecessors, (95), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-05 20:19:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-05 20:19:03,799 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 91 [2024-11-05 20:19:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 20:19:03,799 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-05 20:19:03,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-05 20:19:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-05 20:19:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-05 20:19:03,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 20:19:03,805 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:19:03,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 20:19:04,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 20:19:04,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 20:19:04,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 20:19:04,006 INFO L85 PathProgramCache]: Analyzing trace with hash -150746959, now seen corresponding path program 1 times [2024-11-05 20:19:04,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 20:19:04,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [553905109] [2024-11-05 20:19:04,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 20:19:04,007 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 20:19:04,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 20:19:04,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 20:19:04,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 20:19:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 20:19:04,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-05 20:19:04,174 INFO L278 TraceCheckSpWp]: Computing forward predicates...