/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-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:29:10,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:29:10,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 08:29:10,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:29:10,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:29:10,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:29:10,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:29:10,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:29:10,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:29:10,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:29:10,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:29:10,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:29:10,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:29:10,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:29:10,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:29:10,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:29:10,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:29:10,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:29:10,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:29:10,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:29:10,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:29:10,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:29:10,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:29:10,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:29:10,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:29:10,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:29:10,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:29:10,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:29:10,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:29:10,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:29:10,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:29:10,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:29:10,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:29:10,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:29:10,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:29:10,137 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:29:10,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:29:10,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:29:10,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:29:10,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:29:10,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:29:10,138 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 08:29:10,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:29:10,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:29:10,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:29:10,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:29:10,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:29:10,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:29:11,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:29:12,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:29:12,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:29:12,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31cc15c30/04d79bd0db234a7dbb98d96ed0d38280/FLAG258f72b73 [2024-11-05 08:29:12,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31cc15c30/04d79bd0db234a7dbb98d96ed0d38280 [2024-11-05 08:29:12,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:29:12,074 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:29:12,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:29:12,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:29:12,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:29:12,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab5ecb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12, skipping insertion in model container [2024-11-05 08:29:12,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:29:12,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2024-11-05 08:29:12,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:29:12,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:29:12,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2024-11-05 08:29:12,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:29:12,674 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:29:12,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12 WrapperNode [2024-11-05 08:29:12,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:29:12,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:29:12,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:29:12,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:29:12,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,753 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 953 [2024-11-05 08:29:12,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:29:12,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:29:12,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:29:12,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:29:12,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,820 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2024-11-05 08:29:12,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:29:12,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:29:12,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:29:12,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:29:12,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (1/1) ... [2024-11-05 08:29:12,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:29:12,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:29:12,911 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 08:29:12,917 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 08:29:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:29:12,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:29:12,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:29:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:29:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:29:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:29:12,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:29:12,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-05 08:29:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-05 08:29:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-05 08:29:12,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:29:13,191 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:29:13,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:29:13,960 INFO L? ?]: Removed 675 outVars from TransFormulas that were not future-live. [2024-11-05 08:29:13,961 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:29:13,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:29:13,974 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-05 08:29:13,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:13 BoogieIcfgContainer [2024-11-05 08:29:13,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:29:13,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:29:13,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:29:13,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:29:13,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:29:12" (1/3) ... [2024-11-05 08:29:13,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ba86ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:13, skipping insertion in model container [2024-11-05 08:29:13,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:29:12" (2/3) ... [2024-11-05 08:29:13,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ba86ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:29:13, skipping insertion in model container [2024-11-05 08:29:13,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:29:13" (3/3) ... [2024-11-05 08:29:13,985 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-05 08:29:14,000 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:29:14,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:29:14,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:29:14,056 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;@35109102, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:29:14,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:29:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:29:14,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:14,067 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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 08:29:14,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1919498836, now seen corresponding path program 1 times [2024-11-05 08:29:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94106347] [2024-11-05 08:29:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:14,079 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 08:29:14,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:14,081 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 08:29:14,083 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 08:29:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:14,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:29:14,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-05 08:29:14,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:29:14,550 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94106347] [2024-11-05 08:29:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [94106347] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:29:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:29:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:29:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145721128] [2024-11-05 08:29:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:14,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:29:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:29:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:29:14,603 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 08:29:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:14,621 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2024-11-05 08:29:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:29:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-11-05 08:29:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:14,628 INFO L225 Difference]: With dead ends: 77 [2024-11-05 08:29:14,628 INFO L226 Difference]: Without dead ends: 39 [2024-11-05 08:29:14,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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 08:29:14,633 INFO L432 NwaCegarLoop]: 49 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, 49 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 08:29:14,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-05 08:29:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-05 08:29:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-05 08:29:14,665 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 39 [2024-11-05 08:29:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:14,665 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-05 08:29:14,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 08:29:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-05 08:29:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:29:14,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:14,669 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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 08:29:14,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 08:29:14,869 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 08:29:14,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:14,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1633554172, now seen corresponding path program 1 times [2024-11-05 08:29:14,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:14,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905754412] [2024-11-05 08:29:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:14,872 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 08:29:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:14,875 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 08:29:14,876 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 08:29:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:15,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:15,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:15,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:15,266 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905754412] [2024-11-05 08:29:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1905754412] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:15,266 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:15,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201802099] [2024-11-05 08:29:15,267 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:15,269 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:15,296 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2024-11-05 08:29:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:15,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 39 [2024-11-05 08:29:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:15,298 INFO L225 Difference]: With dead ends: 77 [2024-11-05 08:29:15,298 INFO L226 Difference]: Without dead ends: 42 [2024-11-05 08:29:15,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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 08:29:15,299 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:15,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-05 08:29:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-05 08:29:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-05 08:29:15,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2024-11-05 08:29:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:15,306 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-05 08:29:15,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-05 08:29:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-05 08:29:15,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:15,309 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 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 08:29:15,315 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 08:29:15,512 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 08:29:15,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:15,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -682782464, now seen corresponding path program 1 times [2024-11-05 08:29:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006768379] [2024-11-05 08:29:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:15,514 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 08:29:15,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:15,520 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 08:29:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:29:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:15,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:15,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:15,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:15,926 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:15,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006768379] [2024-11-05 08:29:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2006768379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:15,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:15,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:15,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334966282] [2024-11-05 08:29:15,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:15,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:15,929 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:16,020 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-11-05 08:29:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 43 [2024-11-05 08:29:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:16,026 INFO L225 Difference]: With dead ends: 85 [2024-11-05 08:29:16,026 INFO L226 Difference]: Without dead ends: 50 [2024-11-05 08:29:16,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:16,027 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:16,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 223 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-05 08:29:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-05 08:29:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-05 08:29:16,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 43 [2024-11-05 08:29:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:16,037 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-05 08:29:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-05 08:29:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-05 08:29:16,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:16,039 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 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 08:29:16,046 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 08:29:16,239 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 08:29:16,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:16,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1659549432, now seen corresponding path program 2 times [2024-11-05 08:29:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211291241] [2024-11-05 08:29:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:16,241 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 08:29:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:16,242 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 08:29:16,243 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 08:29:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:16,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:16,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:16,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:29:16,794 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211291241] [2024-11-05 08:29:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [211291241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:16,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306324347] [2024-11-05 08:29:16,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:16,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:16,800 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:16,948 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-05 08:29:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 51 [2024-11-05 08:29:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:16,952 INFO L225 Difference]: With dead ends: 89 [2024-11-05 08:29:16,952 INFO L226 Difference]: Without dead ends: 54 [2024-11-05 08:29:16,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:16,954 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:16,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-05 08:29:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-05 08:29:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-05 08:29:16,976 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 51 [2024-11-05 08:29:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:16,976 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-05 08:29:16,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-05 08:29:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-05 08:29:16,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:16,978 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 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 08:29:16,986 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 08:29:17,178 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 08:29:17,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:17,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash 488258804, now seen corresponding path program 3 times [2024-11-05 08:29:17,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:17,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535598166] [2024-11-05 08:29:17,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:17,180 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 08:29:17,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:17,181 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 08:29:17,183 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 08:29:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:17,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:17,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:17,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:17,574 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:17,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535598166] [2024-11-05 08:29:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1535598166] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:17,574 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053941932] [2024-11-05 08:29:17,575 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:17,578 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:17,609 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-05 08:29:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 55 [2024-11-05 08:29:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:17,611 INFO L225 Difference]: With dead ends: 89 [2024-11-05 08:29:17,611 INFO L226 Difference]: Without dead ends: 57 [2024-11-05 08:29:17,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 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 08:29:17,612 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-05 08:29:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-05 08:29:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-11-05 08:29:17,623 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 55 [2024-11-05 08:29:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:17,623 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-11-05 08:29:17,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-11-05 08:29:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-05 08:29:17,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:17,624 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 2, 2, 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 08:29:17,630 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 (6)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 08:29:17,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:17,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:17,826 INFO L85 PathProgramCache]: Analyzing trace with hash -526560144, now seen corresponding path program 1 times [2024-11-05 08:29:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822377896] [2024-11-05 08:29:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:17,827 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 08:29:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:17,828 INFO L229 MonitoredProcess]: Starting monitored process 7 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 08:29:17,829 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 (7)] Waiting until timeout for monitored process [2024-11-05 08:29:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:18,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:18,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:18,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:18,263 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822377896] [2024-11-05 08:29:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1822377896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:18,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727551375] [2024-11-05 08:29:18,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:18,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:18,265 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:18,340 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2024-11-05 08:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 59 [2024-11-05 08:29:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:18,349 INFO L225 Difference]: With dead ends: 97 [2024-11-05 08:29:18,350 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 08:29:18,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:18,351 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:18,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 08:29:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-05 08:29:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-05 08:29:18,360 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 59 [2024-11-05 08:29:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:18,360 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-05 08:29:18,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-05 08:29:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-05 08:29:18,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:18,364 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 5, 5, 5, 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 08:29:18,371 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 (7)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 08:29:18,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash -47044248, now seen corresponding path program 2 times [2024-11-05 08:29:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309552136] [2024-11-05 08:29:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:18,567 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 08:29:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:18,569 INFO L229 MonitoredProcess]: Starting monitored process 8 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 08:29:18,569 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 (8)] Waiting until timeout for monitored process [2024-11-05 08:29:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:18,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:18,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:18,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-05 08:29:19,083 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:19,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309552136] [2024-11-05 08:29:19,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [309552136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:19,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:19,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:19,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008430290] [2024-11-05 08:29:19,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:19,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:19,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:19,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:19,086 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:19,227 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-05 08:29:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-05 08:29:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:19,229 INFO L225 Difference]: With dead ends: 101 [2024-11-05 08:29:19,229 INFO L226 Difference]: Without dead ends: 69 [2024-11-05 08:29:19,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:19,230 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:19,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 434 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-05 08:29:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-05 08:29:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 08:29:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-05 08:29:19,236 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 67 [2024-11-05 08:29:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:19,236 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-05 08:29:19,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-05 08:29:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-11-05 08:29:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-05 08:29:19,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:19,238 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 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 08:29:19,245 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 (8)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 08:29:19,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -515774748, now seen corresponding path program 3 times [2024-11-05 08:29:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:19,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581681063] [2024-11-05 08:29:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:19,440 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 08:29:19,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:19,443 INFO L229 MonitoredProcess]: Starting monitored process 9 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 08:29:19,444 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 (9)] Waiting until timeout for monitored process [2024-11-05 08:29:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:19,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 08:29:19,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:29:20,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-05 08:29:20,984 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:20,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581681063] [2024-11-05 08:29:20,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [581681063] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:20,985 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-05 08:29:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490482527] [2024-11-05 08:29:20,985 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:20,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:20,987 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:29:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:21,241 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-11-05 08:29:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:29:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-11-05 08:29:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:21,242 INFO L225 Difference]: With dead ends: 83 [2024-11-05 08:29:21,243 INFO L226 Difference]: Without dead ends: 81 [2024-11-05 08:29:21,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:21,243 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:21,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:29:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-05 08:29:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-05 08:29:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-05 08:29:21,263 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 71 [2024-11-05 08:29:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:21,264 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-05 08:29:21,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 08:29:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-05 08:29:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-05 08:29:21,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:21,266 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:21,275 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 (9)] Ended with exit code 0 [2024-11-05 08:29:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 08:29:21,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1746558445, now seen corresponding path program 1 times [2024-11-05 08:29:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285233150] [2024-11-05 08:29:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:21,468 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 08:29:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:21,469 INFO L229 MonitoredProcess]: Starting monitored process 10 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 08:29:21,470 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 (10)] Waiting until timeout for monitored process [2024-11-05 08:29:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:22,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:22,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:29:22,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:29:22,252 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285233150] [2024-11-05 08:29:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1285233150] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:22,252 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047528848] [2024-11-05 08:29:22,252 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:22,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:22,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:22,254 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:22,303 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2024-11-05 08:29:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:22,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-11-05 08:29:22,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:22,306 INFO L225 Difference]: With dead ends: 115 [2024-11-05 08:29:22,306 INFO L226 Difference]: Without dead ends: 84 [2024-11-05 08:29:22,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 220 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 08:29:22,307 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:22,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-05 08:29:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-05 08:29:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 72 states have internal predecessors, (79), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-11-05 08:29:22,318 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 112 [2024-11-05 08:29:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-11-05 08:29:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-11-05 08:29:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:29:22,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:22,320 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:22,332 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 (10)] Ended with exit code 0 [2024-11-05 08:29:22,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 08:29:22,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:22,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash -830156913, now seen corresponding path program 1 times [2024-11-05 08:29:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141658499] [2024-11-05 08:29:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:22,525 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 08:29:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:22,528 INFO L229 MonitoredProcess]: Starting monitored process 11 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 08:29:22,529 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 (11)] Waiting until timeout for monitored process [2024-11-05 08:29:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:23,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:23,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:29:23,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:29:23,361 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141658499] [2024-11-05 08:29:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2141658499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:23,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499361602] [2024-11-05 08:29:23,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:23,363 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:23,490 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2024-11-05 08:29:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-05 08:29:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:23,494 INFO L225 Difference]: With dead ends: 126 [2024-11-05 08:29:23,494 INFO L226 Difference]: Without dead ends: 92 [2024-11-05 08:29:23,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:23,495 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:23,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-05 08:29:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-05 08:29:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.0875) internal successors, (87), 80 states have internal predecessors, (87), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-11-05 08:29:23,505 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 116 [2024-11-05 08:29:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:23,505 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-11-05 08:29:23,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-11-05 08:29:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-05 08:29:23,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:23,507 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:23,519 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 (11)] Ended with exit code 0 [2024-11-05 08:29:23,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 08:29:23,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 518049927, now seen corresponding path program 2 times [2024-11-05 08:29:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:23,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113049335] [2024-11-05 08:29:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:23,712 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 08:29:23,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:23,715 INFO L229 MonitoredProcess]: Starting monitored process 12 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 08:29:23,715 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 (12)] Waiting until timeout for monitored process [2024-11-05 08:29:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:24,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:24,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-05 08:29:24,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-05 08:29:24,731 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113049335] [2024-11-05 08:29:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1113049335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:24,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709421686] [2024-11-05 08:29:24,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:24,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:24,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:24,734 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:24,920 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2024-11-05 08:29:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-05 08:29:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:24,924 INFO L225 Difference]: With dead ends: 138 [2024-11-05 08:29:24,924 INFO L226 Difference]: Without dead ends: 96 [2024-11-05 08:29:24,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:24,925 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:24,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 348 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:29:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-05 08:29:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-05 08:29:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 84 states have internal predecessors, (91), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-05 08:29:24,935 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 124 [2024-11-05 08:29:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-05 08:29:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-05 08:29:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-05 08:29:24,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:24,937 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:24,951 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 (12)] Ended with exit code 0 [2024-11-05 08:29:25,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 08:29:25,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -291789821, now seen corresponding path program 3 times [2024-11-05 08:29:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669760391] [2024-11-05 08:29:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:25,139 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 08:29:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:25,140 INFO L229 MonitoredProcess]: Starting monitored process 13 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 08:29:25,141 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 (13)] Waiting until timeout for monitored process [2024-11-05 08:29:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:26,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:26,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:29:26,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:29:26,125 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:26,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669760391] [2024-11-05 08:29:26,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1669760391] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:26,125 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056543628] [2024-11-05 08:29:26,125 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:26,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:26,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:26,127 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:26,162 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2024-11-05 08:29:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2024-11-05 08:29:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:26,164 INFO L225 Difference]: With dead ends: 145 [2024-11-05 08:29:26,164 INFO L226 Difference]: Without dead ends: 99 [2024-11-05 08:29:26,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 252 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 08:29:26,165 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:26,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-05 08:29:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-05 08:29:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 87 states have internal predecessors, (94), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-05 08:29:26,182 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 128 [2024-11-05 08:29:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:26,182 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-05 08:29:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-05 08:29:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 08:29:26,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:26,184 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:26,201 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 (13)] Ended with exit code 0 [2024-11-05 08:29:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 08:29:26,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:26,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash -297563905, now seen corresponding path program 1 times [2024-11-05 08:29:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038717397] [2024-11-05 08:29:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:26,388 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 08:29:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:26,389 INFO L229 MonitoredProcess]: Starting monitored process 14 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 08:29:26,390 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 (14)] Waiting until timeout for monitored process [2024-11-05 08:29:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:27,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:27,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:29:27,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:29:27,526 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:27,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038717397] [2024-11-05 08:29:27,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1038717397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:27,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705133415] [2024-11-05 08:29:27,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:27,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:27,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:27,528 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:27,648 INFO L93 Difference]: Finished difference Result 156 states and 183 transitions. [2024-11-05 08:29:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:27,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-05 08:29:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:27,652 INFO L225 Difference]: With dead ends: 156 [2024-11-05 08:29:27,652 INFO L226 Difference]: Without dead ends: 107 [2024-11-05 08:29:27,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:27,653 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:27,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-05 08:29:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-05 08:29:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 95 states have internal predecessors, (102), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-11-05 08:29:27,671 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 132 [2024-11-05 08:29:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:27,671 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-11-05 08:29:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-11-05 08:29:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-05 08:29:27,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:27,673 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:27,694 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 (14)] Ended with exit code 0 [2024-11-05 08:29:27,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 08:29:27,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:27,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1407600393, now seen corresponding path program 2 times [2024-11-05 08:29:27,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1234598455] [2024-11-05 08:29:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:27,875 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 08:29:27,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:27,879 INFO L229 MonitoredProcess]: Starting monitored process 15 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 08:29:27,880 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 (15)] Waiting until timeout for monitored process [2024-11-05 08:29:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:29,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:29,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-05 08:29:29,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-05 08:29:29,225 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1234598455] [2024-11-05 08:29:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1234598455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:29,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733956696] [2024-11-05 08:29:29,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:29,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:29,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:29,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:29,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:29,227 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:29,417 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2024-11-05 08:29:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2024-11-05 08:29:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:29,420 INFO L225 Difference]: With dead ends: 168 [2024-11-05 08:29:29,420 INFO L226 Difference]: Without dead ends: 111 [2024-11-05 08:29:29,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:29,421 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:29,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 391 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:29:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-05 08:29:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-05 08:29:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-05 08:29:29,432 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 140 [2024-11-05 08:29:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:29,433 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-05 08:29:29,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-05 08:29:29,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-05 08:29:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:29,435 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:29,452 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 (15)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:29,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 08:29:29,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash -469367821, now seen corresponding path program 3 times [2024-11-05 08:29:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061135503] [2024-11-05 08:29:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:29,637 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 08:29:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:29,639 INFO L229 MonitoredProcess]: Starting monitored process 16 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 08:29:29,640 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 (16)] Waiting until timeout for monitored process [2024-11-05 08:29:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:30,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:30,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:29:30,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:29:30,978 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061135503] [2024-11-05 08:29:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1061135503] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:30,978 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712709437] [2024-11-05 08:29:30,978 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:30,980 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:31,007 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2024-11-05 08:29:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2024-11-05 08:29:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:31,009 INFO L225 Difference]: With dead ends: 175 [2024-11-05 08:29:31,009 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:29:31,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 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 08:29:31,010 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:31,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 133 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:29:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-05 08:29:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.0686274509803921) internal successors, (109), 102 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-05 08:29:31,026 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 144 [2024-11-05 08:29:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:31,026 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-05 08:29:31,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-05 08:29:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-05 08:29:31,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:31,028 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:31,042 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 (16)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:31,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 08:29:31,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:31,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1956806545, now seen corresponding path program 1 times [2024-11-05 08:29:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1470459733] [2024-11-05 08:29:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:31,230 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 08:29:31,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:31,231 INFO L229 MonitoredProcess]: Starting monitored process 17 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 08:29:31,232 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 (17)] Waiting until timeout for monitored process [2024-11-05 08:29:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:32,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:32,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:29:32,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:29:32,625 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1470459733] [2024-11-05 08:29:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1470459733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:32,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738460097] [2024-11-05 08:29:32,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:32,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:32,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:32,627 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:32,705 INFO L93 Difference]: Finished difference Result 186 states and 213 transitions. [2024-11-05 08:29:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:32,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 148 [2024-11-05 08:29:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:32,707 INFO L225 Difference]: With dead ends: 186 [2024-11-05 08:29:32,707 INFO L226 Difference]: Without dead ends: 122 [2024-11-05 08:29:32,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:32,708 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:32,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-05 08:29:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-05 08:29:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 110 states have internal predecessors, (117), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-11-05 08:29:32,718 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 148 [2024-11-05 08:29:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:32,718 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-11-05 08:29:32,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-11-05 08:29:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-05 08:29:32,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:32,719 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:32,736 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 (17)] Ended with exit code 0 [2024-11-05 08:29:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 08:29:32,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -525623449, now seen corresponding path program 2 times [2024-11-05 08:29:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258679254] [2024-11-05 08:29:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:32,921 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 08:29:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:32,922 INFO L229 MonitoredProcess]: Starting monitored process 18 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 08:29:32,923 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 (18)] Waiting until timeout for monitored process [2024-11-05 08:29:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:34,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:34,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-05 08:29:34,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-05 08:29:34,545 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258679254] [2024-11-05 08:29:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1258679254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:34,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:34,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:34,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648786962] [2024-11-05 08:29:34,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:34,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:34,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:34,548 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:34,705 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2024-11-05 08:29:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 156 [2024-11-05 08:29:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:34,707 INFO L225 Difference]: With dead ends: 198 [2024-11-05 08:29:34,707 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 08:29:34,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:34,708 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:34,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 434 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 08:29:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-05 08:29:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 114 states have (on average 1.0614035087719298) internal successors, (121), 114 states have internal predecessors, (121), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2024-11-05 08:29:34,718 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 156 [2024-11-05 08:29:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:34,718 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2024-11-05 08:29:34,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2024-11-05 08:29:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-05 08:29:34,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:34,719 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:34,735 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 (18)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 08:29:34,920 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1008746979, now seen corresponding path program 3 times [2024-11-05 08:29:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776430767] [2024-11-05 08:29:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:34,921 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 08:29:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:34,923 INFO L229 MonitoredProcess]: Starting monitored process 19 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 08:29:34,924 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 (19)] Waiting until timeout for monitored process [2024-11-05 08:29:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:36,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 08:29:36,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:29:36,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:29:36,504 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776430767] [2024-11-05 08:29:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [776430767] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:29:36,504 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:29:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 08:29:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201757343] [2024-11-05 08:29:36,505 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:29:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:29:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:36,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:29:36,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:29:36,506 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:36,533 INFO L93 Difference]: Finished difference Result 205 states and 230 transitions. [2024-11-05 08:29:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:29:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2024-11-05 08:29:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:36,535 INFO L225 Difference]: With dead ends: 205 [2024-11-05 08:29:36,535 INFO L226 Difference]: Without dead ends: 129 [2024-11-05 08:29:36,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 316 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 08:29:36,536 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:36,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:29:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-05 08:29:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-05 08:29:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.0598290598290598) internal successors, (124), 117 states have internal predecessors, (124), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2024-11-05 08:29:36,547 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 160 [2024-11-05 08:29:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2024-11-05 08:29:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2024-11-05 08:29:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-05 08:29:36,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:36,549 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:36,569 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 (19)] Ended with exit code 0 [2024-11-05 08:29:36,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 08:29:36,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:36,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash 134624735, now seen corresponding path program 1 times [2024-11-05 08:29:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:36,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644405374] [2024-11-05 08:29:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:36,751 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 08:29:36,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:36,752 INFO L229 MonitoredProcess]: Starting monitored process 20 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 08:29:36,754 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 (20)] Waiting until timeout for monitored process [2024-11-05 08:29:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:38,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:29:38,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:29:38,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:29:38,760 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644405374] [2024-11-05 08:29:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [644405374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:38,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:38,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 08:29:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043486490] [2024-11-05 08:29:38,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:38,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:29:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:29:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:29:38,762 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:38,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:38,840 INFO L93 Difference]: Finished difference Result 216 states and 243 transitions. [2024-11-05 08:29:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:29:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2024-11-05 08:29:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:38,842 INFO L225 Difference]: With dead ends: 216 [2024-11-05 08:29:38,842 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 08:29:38,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:29:38,843 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:38,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 08:29:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-05 08:29:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 125 states have (on average 1.056) internal successors, (132), 125 states have internal predecessors, (132), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2024-11-05 08:29:38,854 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 164 [2024-11-05 08:29:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:38,854 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2024-11-05 08:29:38,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2024-11-05 08:29:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-05 08:29:38,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:38,855 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:38,874 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 (20)] Ended with exit code 0 [2024-11-05 08:29:39,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 08:29:39,056 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -952499241, now seen corresponding path program 2 times [2024-11-05 08:29:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795287765] [2024-11-05 08:29:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:39,057 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 08:29:39,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:39,060 INFO L229 MonitoredProcess]: Starting monitored process 21 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 08:29:39,061 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 (21)] Waiting until timeout for monitored process [2024-11-05 08:29:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:40,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:29:40,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 112 proven. 36 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-05 08:29:40,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-05 08:29:41,053 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:41,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795287765] [2024-11-05 08:29:41,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1795287765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:41,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:41,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-05 08:29:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986594208] [2024-11-05 08:29:41,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:41,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:29:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:29:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:41,055 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:41,208 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2024-11-05 08:29:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:29:41,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2024-11-05 08:29:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:41,210 INFO L225 Difference]: With dead ends: 228 [2024-11-05 08:29:41,211 INFO L226 Difference]: Without dead ends: 141 [2024-11-05 08:29:41,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:29:41,212 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:41,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:29:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-05 08:29:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-05 08:29:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:29:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2024-11-05 08:29:41,224 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 172 [2024-11-05 08:29:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:41,225 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2024-11-05 08:29:41,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:29:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2024-11-05 08:29:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-05 08:29:41,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:41,226 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:41,255 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 (21)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 08:29:41,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:41,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash 197516755, now seen corresponding path program 3 times [2024-11-05 08:29:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:41,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384469470] [2024-11-05 08:29:41,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:41,431 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 08:29:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:41,433 INFO L229 MonitoredProcess]: Starting monitored process 22 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 08:29:41,433 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 (22)] Waiting until timeout for monitored process [2024-11-05 08:29:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:43,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-05 08:29:43,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:29:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-05 08:29:44,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:29:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-05 08:29:47,174 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:29:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384469470] [2024-11-05 08:29:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [384469470] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:29:47,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:29:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-05 08:29:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309962550] [2024-11-05 08:29:47,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:29:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:29:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:29:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:29:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:29:47,176 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 19 states have internal predecessors, (90), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-05 08:29:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:29:47,789 INFO L93 Difference]: Finished difference Result 265 states and 291 transitions. [2024-11-05 08:29:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 08:29:47,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 19 states have internal predecessors, (90), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 176 [2024-11-05 08:29:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:29:47,791 INFO L225 Difference]: With dead ends: 265 [2024-11-05 08:29:47,791 INFO L226 Difference]: Without dead ends: 263 [2024-11-05 08:29:47,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-11-05 08:29:47,792 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 153 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:29:47,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 433 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 08:29:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-05 08:29:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2024-11-05 08:29:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.0526315789473684) internal successors, (220), 209 states have internal predecessors, (220), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-05 08:29:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 250 transitions. [2024-11-05 08:29:47,813 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 250 transitions. Word has length 176 [2024-11-05 08:29:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:29:47,814 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 250 transitions. [2024-11-05 08:29:47,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.294117647058823) internal successors, (90), 19 states have internal predecessors, (90), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-05 08:29:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2024-11-05 08:29:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-05 08:29:47,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:29:47,816 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:29:47,832 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 (22)] Forceful destruction successful, exit code 0 [2024-11-05 08:29:48,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 08:29:48,016 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:29:48,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:29:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1897711676, now seen corresponding path program 4 times [2024-11-05 08:29:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:29:48,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125992623] [2024-11-05 08:29:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:29:48,017 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 08:29:48,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:29:48,020 INFO L229 MonitoredProcess]: Starting monitored process 23 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 08:29:48,022 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 (23)] Waiting until timeout for monitored process [2024-11-05 08:29:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:29:54,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 2266 conjuncts, 245 conjuncts are in the unsatisfiable core [2024-11-05 08:29:54,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:30:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 84 proven. 687 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2024-11-05 08:30:01,697 INFO L311 TraceCheckSpWp]: Computing backward predicates...