/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-89.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:48:57,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:48:58,023 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:48:58,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:48:58,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:48:58,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:48:58,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:48:58,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:48:58,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:48:58,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:48:58,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:48:58,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:48:58,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:48:58,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:48:58,066 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:48:58,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:48:58,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:48:58,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:48:58,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:48:58,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:48:58,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:48:58,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:48:58,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:48:58,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:48:58,069 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:48:58,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:48:58,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:48:58,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:48:58,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:48:58,071 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:48:58,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:48:58,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:48:58,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:48:58,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:48:58,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:48:58,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:48:58,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:48:58,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:48:58,074 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:48:58,074 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:48:58,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:48:58,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:48:58,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:48:58,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:48:58,075 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:48:58,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:48:58,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:48:58,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:48:58,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:48:58,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:48:58,336 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-89.i [2024-11-05 19:48:59,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:49:00,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:49:00,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2024-11-05 19:49:00,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d9a9547/b2a881ab701940c391875602221cf7e8/FLAGcf09e7aea [2024-11-05 19:49:00,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d9a9547/b2a881ab701940c391875602221cf7e8 [2024-11-05 19:49:00,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:49:00,070 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:49:00,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:49:00,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:49:00,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:49:00,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:49:00" (1/1) ... [2024-11-05 19:49:00,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445fc325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:00, skipping insertion in model container [2024-11-05 19:49:00,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:49:00" (1/1) ... [2024-11-05 19:49:00,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:49:00,302 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-89.i[916,929] [2024-11-05 19:49:00,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:49:00,474 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:49:00,485 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-89.i[916,929] [2024-11-05 19:49:00,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:49:00,573 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:49:00,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:00 WrapperNode [2024-11-05 19:49:00,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:49:00,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:49:00,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:49:00,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:49:00,583 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:00" (1/1) ... [2024-11-05 19:49:00,612 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:00" (1/1) ... [2024-11-05 19:49:00,652 INFO L138 Inliner]: procedures = 27, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 339 [2024-11-05 19:49:00,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:49:00,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:49:00,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:49:00,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:49:00,663 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:00" (1/1) ... [2024-11-05 19:49:00,664 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:00" (1/1) ... [2024-11-05 19:49:00,676 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:00" (1/1) ... [2024-11-05 19:49:00,703 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:00,704 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:00" (1/1) ... [2024-11-05 19:49:00,704 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:00" (1/1) ... [2024-11-05 19:49:00,726 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:00" (1/1) ... [2024-11-05 19:49:00,734 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:00" (1/1) ... [2024-11-05 19:49:00,746 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:00" (1/1) ... [2024-11-05 19:49:00,753 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:00" (1/1) ... [2024-11-05 19:49:00,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:49:00,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:49:00,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:49:00,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:49:00,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:00" (1/1) ... [2024-11-05 19:49:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:49:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:49:00,826 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:00,829 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:00,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:49:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:49:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:49:00,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:49:00,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:49:00,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:49:00,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:49:00,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:49:07,624 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-05 19:49:07,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:49:07,648 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:49:07,649 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:49:07,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:49:07 BoogieIcfgContainer [2024-11-05 19:49:07,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:49:07,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:49:07,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:49:07,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:49:07,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:49:00" (1/3) ... [2024-11-05 19:49:07,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f41a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:49:07, skipping insertion in model container [2024-11-05 19:49:07,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:49:00" (2/3) ... [2024-11-05 19:49:07,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f41a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:49:07, skipping insertion in model container [2024-11-05 19:49:07,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:49:07" (3/3) ... [2024-11-05 19:49:07,662 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-89.i [2024-11-05 19:49:07,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:49:07,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:49:07,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:49:07,748 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;@4f283d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:49:07,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:49:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 102 states have internal predecessors, (155), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:49:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-05 19:49:07,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:07,771 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -344873712, now seen corresponding path program 1 times [2024-11-05 19:49:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549897502] [2024-11-05 19:49:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:07,784 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:07,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:07,785 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:07,787 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:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:08,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:49:08,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2024-11-05 19:49:08,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2024-11-05 19:49:10,011 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:10,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549897502] [2024-11-05 19:49:10,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1549897502] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:49:10,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:49:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:49:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386775147] [2024-11-05 19:49:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:49:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:49:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:49:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:49:10,046 INFO L87 Difference]: Start difference. First operand has 147 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 102 states have internal predecessors, (155), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-05 19:49:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:49:10,094 INFO L93 Difference]: Finished difference Result 287 states and 519 transitions. [2024-11-05 19:49:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:49:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 283 [2024-11-05 19:49:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:49:10,109 INFO L225 Difference]: With dead ends: 287 [2024-11-05 19:49:10,109 INFO L226 Difference]: Without dead ends: 143 [2024-11-05 19:49:10,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 564 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:10,120 INFO L432 NwaCegarLoop]: 234 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, 234 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:10,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 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:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-05 19:49:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-05 19:49:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-05 19:49:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 234 transitions. [2024-11-05 19:49:10,184 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 234 transitions. Word has length 283 [2024-11-05 19:49:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:49:10,185 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 234 transitions. [2024-11-05 19:49:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-05 19:49:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 234 transitions. [2024-11-05 19:49:10,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-05 19:49:10,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:10,193 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 19:49:10,394 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:10,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:10,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1001498174, now seen corresponding path program 1 times [2024-11-05 19:49:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537758871] [2024-11-05 19:49:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:10,396 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:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:10,398 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:10,399 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:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:11,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:49:11,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 658 proven. 114 refuted. 0 times theorem prover too weak. 2840 trivial. 0 not checked. [2024-11-05 19:49:14,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 12 proven. 114 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-05 19:49:17,330 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537758871] [2024-11-05 19:49:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [537758871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:49:17,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:49:17,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:49:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114727223] [2024-11-05 19:49:17,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:49:17,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:49:17,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:49:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:49:17,335 INFO L87 Difference]: Start difference. First operand 143 states and 234 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2024-11-05 19:49:23,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:49:27,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:49:31,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:49:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:49:32,192 INFO L93 Difference]: Finished difference Result 293 states and 474 transitions. [2024-11-05 19:49:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:49:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 283 [2024-11-05 19:49:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:49:32,197 INFO L225 Difference]: With dead ends: 293 [2024-11-05 19:49:32,197 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 19:49:32,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:49:32,200 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 211 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-05 19:49:32,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 425 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 264 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2024-11-05 19:49:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 19:49:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-05 19:49:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:49:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 237 transitions. [2024-11-05 19:49:32,233 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 237 transitions. Word has length 283 [2024-11-05 19:49:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:49:32,238 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 237 transitions. [2024-11-05 19:49:32,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2024-11-05 19:49:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 237 transitions. [2024-11-05 19:49:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-05 19:49:32,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:32,251 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,292 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:49:32,451 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:49:32,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash -817302340, now seen corresponding path program 1 times [2024-11-05 19:49:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489404224] [2024-11-05 19:49:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:32,454 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:32,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:32,456 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:49:32,458 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:49:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:33,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 19:49:33,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2024-11-05 19:49:33,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2024-11-05 19:49:34,998 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489404224] [2024-11-05 19:49:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1489404224] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:49:34,998 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:49:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 19:49:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727055910] [2024-11-05 19:49:34,999 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:49:34,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:49:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:49:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:49:35,001 INFO L87 Difference]: Start difference. First operand 150 states and 237 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2024-11-05 19:49:39,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:49:43,272 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:49:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:49:43,276 INFO L93 Difference]: Finished difference Result 290 states and 460 transitions. [2024-11-05 19:49:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 19:49:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 284 [2024-11-05 19:49:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:49:43,358 INFO L225 Difference]: With dead ends: 290 [2024-11-05 19:49:43,358 INFO L226 Difference]: Without dead ends: 150 [2024-11-05 19:49:43,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:49:43,363 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-05 19:49:43,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-05 19:49:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-05 19:49:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-05 19:49:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-05 19:49:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 236 transitions. [2024-11-05 19:49:43,395 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 236 transitions. Word has length 284 [2024-11-05 19:49:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:49:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 236 transitions. [2024-11-05 19:49:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2024-11-05 19:49:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 236 transitions. [2024-11-05 19:49:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-05 19:49:43,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:49:43,402 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,439 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 19:49:43,602 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 19:49:43,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:49:43,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:49:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1846661638, now seen corresponding path program 1 times [2024-11-05 19:49:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:49:43,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072493622] [2024-11-05 19:49:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:49:43,605 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:43,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:49:43,608 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 19:49:43,609 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 19:49:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:49:44,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:49:44,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:49:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2024-11-05 19:49:48,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:49:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-05 19:49:51,669 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:49:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072493622] [2024-11-05 19:49:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1072493622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:49:51,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:49:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:49:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547801834] [2024-11-05 19:49:51,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:49:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:49:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:49:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:49:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:49:51,676 INFO L87 Difference]: Start difference. First operand 150 states and 236 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, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-11-05 19:49:58,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s 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:02,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:06,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:50:07,287 INFO L93 Difference]: Finished difference Result 304 states and 472 transitions. [2024-11-05 19:50:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:50:07,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 284 [2024-11-05 19:50:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:50:07,291 INFO L225 Difference]: With dead ends: 304 [2024-11-05 19:50:07,291 INFO L226 Difference]: Without dead ends: 164 [2024-11-05 19:50:07,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 560 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:50:07,293 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 99 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-05 19:50:07,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 450 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2024-11-05 19:50:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-05 19:50:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-11-05 19:50:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 108 states have internal predecessors, (146), 49 states have call successors, (49), 4 states have call predecessors, (49), 4 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-05 19:50:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 244 transitions. [2024-11-05 19:50:07,310 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 244 transitions. Word has length 284 [2024-11-05 19:50:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:50:07,311 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 244 transitions. [2024-11-05 19:50:07,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-11-05 19:50:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 244 transitions. [2024-11-05 19:50:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-05 19:50:07,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:50:07,314 INFO L215 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 19:50:07,517 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 19:50:07,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:50:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:50:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash 76566396, now seen corresponding path program 1 times [2024-11-05 19:50:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:50:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363474410] [2024-11-05 19:50:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:50:07,520 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:07,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:50:07,521 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 19:50:07,522 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 19:50:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:50:08,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 19:50:08,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:50:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 86 proven. 246 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-05 19:50:17,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:50:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2024-11-05 19:50:21,363 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:50:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363474410] [2024-11-05 19:50:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [363474410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:50:21,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:50:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-11-05 19:50:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433785782] [2024-11-05 19:50:21,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:50:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 19:50:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:50:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 19:50:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:50:21,366 INFO L87 Difference]: Start difference. First operand 161 states and 244 transitions. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 10 states have internal predecessors, (128), 4 states have call successors, (85), 3 states have call predecessors, (85), 5 states have return successors, (86), 3 states have call predecessors, (86), 4 states have call successors, (86) [2024-11-05 19:50:29,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:50:33,966 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 []