/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_amount100_file-68.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:28:24,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:28:24,856 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:28:24,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:28:24,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:28:24,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:28:24,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:28:24,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:28:24,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:28:24,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:28:24,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:28:24,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:28:24,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:28:24,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:28:24,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:28:24,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:28:24,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:28:24,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:28:24,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:28:24,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:28:24,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:28:24,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:28:24,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:28:24,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:28:24,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:28:24,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:28:24,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:28:24,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:28:24,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:28:24,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:28:24,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:28:24,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:28:24,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:28:24,910 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:28:24,910 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:28:24,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:28:24,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:28:24,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:28:24,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:28:24,913 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:28:25,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:28:25,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:28:25,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:28:25,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:28:25,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:28:25,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2024-11-05 19:28:26,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:28:26,797 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:28:26,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-68.i [2024-11-05 19:28:26,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f128923d/f1daa31abd474a41a3716ef01ba088a0/FLAG72599c373 [2024-11-05 19:28:27,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f128923d/f1daa31abd474a41a3716ef01ba088a0 [2024-11-05 19:28:27,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:28:27,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:28:27,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:28:27,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:28:27,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:28:27,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67734583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27, skipping insertion in model container [2024-11-05 19:28:27,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:28:27,378 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_amount100_file-68.i[916,929] [2024-11-05 19:28:27,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:28:27,480 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:28:27,492 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_amount100_file-68.i[916,929] [2024-11-05 19:28:27,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:28:27,548 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:28:27,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27 WrapperNode [2024-11-05 19:28:27,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:28:27,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:28:27,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:28:27,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:28:27,557 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:28:27" (1/1) ... [2024-11-05 19:28:27,570 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:28:27" (1/1) ... [2024-11-05 19:28:27,599 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-05 19:28:27,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:28:27,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:28:27,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:28:27,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:28:27,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,635 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:28:27,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:28:27,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:28:27,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:28:27,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:28:27,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (1/1) ... [2024-11-05 19:28:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:28:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:28:27,706 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:28:27,710 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:28:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:28:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:28:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:28:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:28:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:28:27,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:28:27,845 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:28:27,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:28:29,772 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-05 19:28:29,772 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:28:29,791 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:28:29,792 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:28:29,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:28:29 BoogieIcfgContainer [2024-11-05 19:28:29,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:28:29,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:28:29,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:28:29,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:28:29,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:28:27" (1/3) ... [2024-11-05 19:28:29,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b24726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:28:29, skipping insertion in model container [2024-11-05 19:28:29,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:28:27" (2/3) ... [2024-11-05 19:28:29,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b24726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:28:29, skipping insertion in model container [2024-11-05 19:28:29,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:28:29" (3/3) ... [2024-11-05 19:28:29,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-68.i [2024-11-05 19:28:29,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:28:29,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:28:29,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:28:29,904 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;@3bea5489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:28:29,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:28:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 19:28:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-05 19:28:29,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:28:29,925 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:29,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:28:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:28:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -820819256, now seen corresponding path program 1 times [2024-11-05 19:28:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:28:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542563415] [2024-11-05 19:28:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:28:29,942 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:28:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:28:29,946 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:28:29,949 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:28:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:28:30,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:28:30,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:28:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2482 trivial. 0 not checked. [2024-11-05 19:28:30,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:28:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2024-11-05 19:28:30,972 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:28:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542563415] [2024-11-05 19:28:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [542563415] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:28:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:28:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:28:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374402795] [2024-11-05 19:28:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:28:30,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:28:30,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:28:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:28:30,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:28:31,000 INFO L87 Difference]: Start difference. First operand has 105 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 19:28:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:28:31,033 INFO L93 Difference]: Finished difference Result 203 states and 362 transitions. [2024-11-05 19:28:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:28:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 251 [2024-11-05 19:28:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:28:31,046 INFO L225 Difference]: With dead ends: 203 [2024-11-05 19:28:31,047 INFO L226 Difference]: Without dead ends: 101 [2024-11-05 19:28:31,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 500 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:28:31,057 INFO L432 NwaCegarLoop]: 157 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, 157 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:28:31,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:28:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-05 19:28:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-05 19:28:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.305084745762712) internal successors, (77), 59 states have internal predecessors, (77), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 19:28:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2024-11-05 19:28:31,103 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 251 [2024-11-05 19:28:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:28:31,104 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2024-11-05 19:28:31,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-05 19:28:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2024-11-05 19:28:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-05 19:28:31,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:28:31,109 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:31,126 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:28:31,313 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:28:31,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:28:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:28:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 666519812, now seen corresponding path program 1 times [2024-11-05 19:28:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:28:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037750243] [2024-11-05 19:28:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:28:31,316 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:28:31,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:28:31,319 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:28:31,320 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:28:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:28:31,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 19:28:31,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:28:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-05 19:28:31,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:28:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-05 19:28:32,256 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:28:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037750243] [2024-11-05 19:28:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2037750243] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:28:32,256 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:28:32,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 19:28:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009827437] [2024-11-05 19:28:32,257 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:28:32,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:28:32,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:28:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:28:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:28:32,263 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-05 19:28:33,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:28:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:28:33,682 INFO L93 Difference]: Finished difference Result 199 states and 311 transitions. [2024-11-05 19:28:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 19:28:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 251 [2024-11-05 19:28:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:28:33,711 INFO L225 Difference]: With dead ends: 199 [2024-11-05 19:28:33,711 INFO L226 Difference]: Without dead ends: 101 [2024-11-05 19:28:33,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:28:33,713 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:28:33,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-05 19:28:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-05 19:28:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-05 19:28:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 59 states have internal predecessors, (76), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-05 19:28:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2024-11-05 19:28:33,739 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 251 [2024-11-05 19:28:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:28:33,741 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2024-11-05 19:28:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-05 19:28:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2024-11-05 19:28:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-05 19:28:33,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:28:33,751 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:33,770 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:28:33,951 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:28:33,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:28:33,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:28:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1022423930, now seen corresponding path program 1 times [2024-11-05 19:28:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:28:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291439800] [2024-11-05 19:28:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:28:33,954 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:28:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:28:33,955 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:28:33,956 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:28:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:28:34,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 19:28:34,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:28:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1219 proven. 87 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2024-11-05 19:28:35,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:28:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 30 proven. 87 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-11-05 19:28:36,184 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:28:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291439800] [2024-11-05 19:28:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1291439800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:28:36,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:28:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-05 19:28:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504669955] [2024-11-05 19:28:36,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:28:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 19:28:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:28:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 19:28:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 19:28:36,188 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2024-11-05 19:28:38,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:28:39,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:28:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:28:39,978 INFO L93 Difference]: Finished difference Result 313 states and 476 transitions. [2024-11-05 19:28:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 19:28:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 251 [2024-11-05 19:28:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:28:39,988 INFO L225 Difference]: With dead ends: 313 [2024-11-05 19:28:39,988 INFO L226 Difference]: Without dead ends: 215 [2024-11-05 19:28:39,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-05 19:28:39,990 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 167 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-05 19:28:39,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 360 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-05 19:28:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-05 19:28:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 205. [2024-11-05 19:28:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 120 states have (on average 1.275) internal successors, (153), 120 states have internal predecessors, (153), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-05 19:28:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 313 transitions. [2024-11-05 19:28:40,035 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 313 transitions. Word has length 251 [2024-11-05 19:28:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:28:40,036 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 313 transitions. [2024-11-05 19:28:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2024-11-05 19:28:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 313 transitions. [2024-11-05 19:28:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-05 19:28:40,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:28:40,040 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:40,062 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:28:40,244 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:28:40,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:28:40,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:28:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1020576888, now seen corresponding path program 1 times [2024-11-05 19:28:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:28:40,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308179685] [2024-11-05 19:28:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:28:40,246 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:28:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:28:40,250 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:28:40,251 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:28:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:28:40,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 19:28:40,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:28:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 2073 proven. 228 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2024-11-05 19:28:44,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:28:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-11-05 19:28:48,337 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:28:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308179685] [2024-11-05 19:28:48,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [308179685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:28:48,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:28:48,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2024-11-05 19:28:48,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497256295] [2024-11-05 19:28:48,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:28:48,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 19:28:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:28:48,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 19:28:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-05 19:28:48,341 INFO L87 Difference]: Start difference. First operand 205 states and 313 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-05 19:28:53,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:28:58,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:02,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:08,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:12,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:17,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:22,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:26,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:30,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:40,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:44,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 19:29:51,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:29:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:29:51,999 INFO L93 Difference]: Finished difference Result 461 states and 667 transitions. [2024-11-05 19:29:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 19:29:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 251 [2024-11-05 19:29:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:29:52,035 INFO L225 Difference]: With dead ends: 461 [2024-11-05 19:29:52,036 INFO L226 Difference]: Without dead ends: 259 [2024-11-05 19:29:52,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=293, Invalid=828, Unknown=1, NotChecked=0, Total=1122 [2024-11-05 19:29:52,037 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 118 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 60 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:29:52,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 523 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 660 Invalid, 11 Unknown, 0 Unchecked, 55.1s Time] [2024-11-05 19:29:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-05 19:29:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2024-11-05 19:29:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 150 states have (on average 1.2066666666666668) internal successors, (181), 150 states have internal predecessors, (181), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-05 19:29:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 341 transitions. [2024-11-05 19:29:52,082 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 341 transitions. Word has length 251 [2024-11-05 19:29:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:29:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 341 transitions. [2024-11-05 19:29:52,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 6 states have call successors, (68), 5 states have call predecessors, (68), 8 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-05 19:29:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 341 transitions. [2024-11-05 19:29:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-05 19:29:52,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:29:52,089 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,110 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 19:29:52,290 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:29:52,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:29:52,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:29:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1994526730, now seen corresponding path program 1 times [2024-11-05 19:29:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:29:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1852702972] [2024-11-05 19:29:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:29:52,292 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:29:52,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:29:52,293 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:29:52,294 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:29:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:29:52,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 19:29:52,731 INFO L278 TraceCheckSpWp]: Computing forward predicates...