/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-39.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:41:47,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:41:47,215 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:41:47,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:41:47,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:41:47,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:41:47,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:41:47,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:41:47,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:41:47,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:41:47,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:41:47,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:41:47,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:41:47,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:41:47,259 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:41:47,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:41:47,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:41:47,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:41:47,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:41:47,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:41:47,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:41:47,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:41:47,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:41:47,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:41:47,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:41:47,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:41:47,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:41:47,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:41:47,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:41:47,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:41:47,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:41:47,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:41:47,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:41:47,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:41:47,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:41:47,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:41:47,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:41:47,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:41:47,266 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:41:47,267 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:41:47,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:41:47,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:41:47,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:41:47,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:41:47,269 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:41:47,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:41:47,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:41:47,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:41:47,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:41:47,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:41:47,571 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-39.i [2024-11-05 19:41:49,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:41:49,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:41:49,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount250_file-39.i [2024-11-05 19:41:49,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e82dbb3/8d9a23aaaccc47d4b0e16ac64654fb16/FLAG8d1dfa8cb [2024-11-05 19:41:49,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e82dbb3/8d9a23aaaccc47d4b0e16ac64654fb16 [2024-11-05 19:41:49,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:41:49,374 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:41:49,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:41:49,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:41:49,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:41:49,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ede1c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49, skipping insertion in model container [2024-11-05 19:41:49,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:49,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:41:49,632 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-39.i[916,929] [2024-11-05 19:41:49,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:41:49,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:41:49,817 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-39.i[916,929] [2024-11-05 19:41:49,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:41:49,934 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:41:49,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49 WrapperNode [2024-11-05 19:41:49,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:41:49,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:41:49,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:41:49,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:41:49,944 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:41:49" (1/1) ... [2024-11-05 19:41:49,962 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:41:49" (1/1) ... [2024-11-05 19:41:49,998 INFO L138 Inliner]: procedures = 27, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 342 [2024-11-05 19:41:49,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:41:50,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:41:50,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:41:50,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:41:50,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,046 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:41:50,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:41:50,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:41:50,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:41:50,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:41:50,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (1/1) ... [2024-11-05 19:41:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:41:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:41:50,158 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:41:50,164 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:41:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:41:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:41:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:41:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:41:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:41:50,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:41:50,332 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:41:50,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:42:12,861 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-05 19:42:12,862 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:42:12,882 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:42:12,882 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:42:12,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:42:12 BoogieIcfgContainer [2024-11-05 19:42:12,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:42:12,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:42:12,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:42:12,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:42:12,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:41:49" (1/3) ... [2024-11-05 19:42:12,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f5a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:42:12, skipping insertion in model container [2024-11-05 19:42:12,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:41:49" (2/3) ... [2024-11-05 19:42:12,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f5a5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:42:12, skipping insertion in model container [2024-11-05 19:42:12,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:42:12" (3/3) ... [2024-11-05 19:42:12,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-39.i [2024-11-05 19:42:12,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:42:12,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:42:13,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:42:13,007 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;@32b8dc0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:42:13,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:42:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 97 states have internal predecessors, (145), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-05 19:42:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-05 19:42:13,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:13,040 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1769614706, now seen corresponding path program 1 times [2024-11-05 19:42:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076201026] [2024-11-05 19:42:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:13,059 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:42:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:13,063 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:42:13,065 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:42:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:14,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:42:14,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:42:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1402 proven. 0 refuted. 0 times theorem prover too weak. 2042 trivial. 0 not checked. [2024-11-05 19:42:14,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:42:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 60 proven. 22 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-11-05 19:42:18,336 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:42:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076201026] [2024-11-05 19:42:18,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2076201026] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:42:18,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:42:18,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:42:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751652676] [2024-11-05 19:42:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:42:18,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:42:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:42:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:42:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:42:18,380 INFO L87 Difference]: Start difference. First operand has 141 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 97 states have internal predecessors, (145), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-05 19:42:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:42:18,425 INFO L93 Difference]: Finished difference Result 275 states and 494 transitions. [2024-11-05 19:42:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:42:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 282 [2024-11-05 19:42:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:42:18,436 INFO L225 Difference]: With dead ends: 275 [2024-11-05 19:42:18,436 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 19:42:18,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 562 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:42:18,443 INFO L432 NwaCegarLoop]: 222 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, 222 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:42:18,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:42:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 19:42:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-05 19:42:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.4838709677419355) internal successors, (138), 93 states have internal predecessors, (138), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-05 19:42:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 222 transitions. [2024-11-05 19:42:18,503 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 222 transitions. Word has length 282 [2024-11-05 19:42:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:42:18,504 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 222 transitions. [2024-11-05 19:42:18,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-05 19:42:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 222 transitions. [2024-11-05 19:42:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-05 19:42:18,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:18,515 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,574 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:42:18,716 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:42:18,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:18,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:18,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1484132394, now seen corresponding path program 1 times [2024-11-05 19:42:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583243620] [2024-11-05 19:42:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:42:18,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:18,721 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:42:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 19:42:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:20,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:42:20,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:42:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1653 proven. 45 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2024-11-05 19:42:24,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:42:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2024-11-05 19:42:30,344 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:42:30,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583243620] [2024-11-05 19:42:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1583243620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:42:30,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:42:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:42:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639489380] [2024-11-05 19:42:30,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:42:30,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:42:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:42:30,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:42:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:42:30,353 INFO L87 Difference]: Start difference. First operand 137 states and 222 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-05 19:42:41,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:42:45,065 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:42:49,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:42:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:42:49,089 INFO L93 Difference]: Finished difference Result 278 states and 446 transitions. [2024-11-05 19:42:49,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 19:42:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 282 [2024-11-05 19:42:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:42:49,285 INFO L225 Difference]: With dead ends: 278 [2024-11-05 19:42:49,285 INFO L226 Difference]: Without dead ends: 144 [2024-11-05 19:42:49,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:42:49,288 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 259 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-05 19:42:49,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 402 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 249 Invalid, 3 Unknown, 0 Unchecked, 18.1s Time] [2024-11-05 19:42:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-05 19:42:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2024-11-05 19:42:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-05 19:42:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 220 transitions. [2024-11-05 19:42:49,309 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 220 transitions. Word has length 282 [2024-11-05 19:42:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:42:49,310 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 220 transitions. [2024-11-05 19:42:49,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-05 19:42:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 220 transitions. [2024-11-05 19:42:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-05 19:42:49,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:42:49,315 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,376 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 (3)] Ended with exit code 0 [2024-11-05 19:42:49,515 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:42:49,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:42:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:42:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1440397205, now seen corresponding path program 1 times [2024-11-05 19:42:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:42:49,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536129945] [2024-11-05 19:42:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:42:49,518 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:42:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:42:49,519 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:42:49,521 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:42:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:42:50,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 19:42:50,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:43:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 893 proven. 105 refuted. 0 times theorem prover too weak. 2446 trivial. 0 not checked. [2024-11-05 19:43:00,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:43:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2024-11-05 19:43:08,640 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:43:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536129945] [2024-11-05 19:43:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [536129945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:43:08,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:43:08,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 19:43:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528952547] [2024-11-05 19:43:08,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:43:08,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 19:43:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:43:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 19:43:08,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:43:08,644 INFO L87 Difference]: Start difference. First operand 140 states and 220 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 3 states have call successors, (77), 2 states have call predecessors, (77), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2024-11-05 19:43:21,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-05 19:43:25,233 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:43:29,240 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 []