/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 10:45:45,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 10:45:45,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 10:45:45,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 10:45:45,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 10:45:45,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 10:45:45,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 10:45:45,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 10:45:45,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 10:45:45,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 10:45:45,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 10:45:45,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 10:45:45,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 10:45:45,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 10:45:45,889 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 10:45:45,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 10:45:45,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 10:45:45,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 10:45:45,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 10:45:45,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 10:45:45,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 10:45:45,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 10:45:45,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 10:45:45,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 10:45:45,891 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 10:45:45,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 10:45:45,892 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 10:45:45,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 10:45:45,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 10:45:45,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 10:45:45,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 10:45:45,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:45:45,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 10:45:45,893 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 10:45:45,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 10:45:45,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 10:45:45,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 10:45:45,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 10:45:45,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 10:45:45,894 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-03 10:45:46,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 10:45:46,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 10:45:46,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 10:45:46,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 10:45:46,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 10:45:46,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-03 10:45:47,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 10:45:47,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 10:45:47,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c [2024-11-03 10:45:47,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2404c66f7/0c78d575ecb64fbd9bf54b3d21dd95cd/FLAGaca652001 [2024-11-03 10:45:47,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2404c66f7/0c78d575ecb64fbd9bf54b3d21dd95cd [2024-11-03 10:45:47,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 10:45:47,881 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 10:45:47,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 10:45:47,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 10:45:47,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 10:45:47,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:45:47" (1/1) ... [2024-11-03 10:45:47,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256c3432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:47, skipping insertion in model container [2024-11-03 10:45:47,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:45:47" (1/1) ... [2024-11-03 10:45:47,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 10:45:48,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-03 10:45:48,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:45:48,034 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 10:45:48,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-03 10:45:48,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:45:48,071 INFO L204 MainTranslator]: Completed translation [2024-11-03 10:45:48,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48 WrapperNode [2024-11-03 10:45:48,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 10:45:48,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 10:45:48,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 10:45:48,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 10:45:48,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,099 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2024-11-03 10:45:48,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 10:45:48,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 10:45:48,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 10:45:48,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 10:45:48,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,118 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-03 10:45:48,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 10:45:48,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 10:45:48,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 10:45:48,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 10:45:48,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (1/1) ... [2024-11-03 10:45:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:45:48,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 10:45:48,160 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-03 10:45:48,162 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-03 10:45:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 10:45:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 10:45:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 10:45:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-03 10:45:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 10:45:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-03 10:45:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-03 10:45:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-03 10:45:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 10:45:48,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 10:45:48,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 10:45:48,491 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-03 10:45:48,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 10:45:48,499 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 10:45:48,500 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 10:45:48,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:45:48 BoogieIcfgContainer [2024-11-03 10:45:48,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 10:45:48,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 10:45:48,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 10:45:48,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 10:45:48,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 10:45:47" (1/3) ... [2024-11-03 10:45:48,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dcd468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:45:48, skipping insertion in model container [2024-11-03 10:45:48,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:48" (2/3) ... [2024-11-03 10:45:48,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dcd468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:45:48, skipping insertion in model container [2024-11-03 10:45:48,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:45:48" (3/3) ... [2024-11-03 10:45:48,507 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-03 10:45:48,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 10:45:48,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 10:45:48,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 10:45:48,575 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;@3fd54076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 10:45:48,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 10:45:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-03 10:45:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 10:45:48,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:48,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-03 10:45:48,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-03 10:45:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1889530928] [2024-11-03 10:45:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:48,595 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-03 10:45:48,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:48,597 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-03 10:45:48,599 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-03 10:45:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:48,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:45:48,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:48,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:48,805 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1889530928] [2024-11-03 10:45:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1889530928] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:48,806 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-03 10:45:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910863159] [2024-11-03 10:45:48,808 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 10:45:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 10:45:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:45:48,831 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 10:45:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:48,892 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-03 10:45:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 10:45:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-03 10:45:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:48,900 INFO L225 Difference]: With dead ends: 113 [2024-11-03 10:45:48,900 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 10:45:48,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:45:48,906 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:48,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 10:45:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-03 10:45:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-03 10:45:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-03 10:45:48,942 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-03 10:45:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-03 10:45:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 10:45:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-03 10:45:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 10:45:48,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:48,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-03 10:45:48,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-03 10:45:49,148 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-03 10:45:49,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-03 10:45:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122919932] [2024-11-03 10:45:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:49,150 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-03 10:45:49,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:49,153 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-03 10:45:49,154 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-03 10:45:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:49,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 10:45:49,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:49,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:49,272 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122919932] [2024-11-03 10:45:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2122919932] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:49,273 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-03 10:45:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240249759] [2024-11-03 10:45:49,273 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:49,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 10:45:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 10:45:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 10:45:49,275 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 10:45:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:49,290 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-03 10:45:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:45:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-03 10:45:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:49,293 INFO L225 Difference]: With dead ends: 62 [2024-11-03 10:45:49,293 INFO L226 Difference]: Without dead ends: 58 [2024-11-03 10:45:49,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 10:45:49,294 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:49,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-03 10:45:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-03 10:45:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-03 10:45:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-03 10:45:49,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-03 10:45:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:49,304 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-03 10:45:49,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 10:45:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-03 10:45:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-03 10:45:49,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:49,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-03 10:45:49,311 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-03 10:45:49,510 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-03 10:45:49,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:49,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-03 10:45:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:49,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036167297] [2024-11-03 10:45:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:49,512 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-03 10:45:49,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:49,515 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-03 10:45:49,516 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-03 10:45:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:49,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-03 10:45:49,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:49,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 10:45:49,761 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036167297] [2024-11-03 10:45:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1036167297] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:49,762 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 12 [2024-11-03 10:45:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222958402] [2024-11-03 10:45:49,762 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:49,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-03 10:45:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-03 10:45:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-03 10:45:49,763 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 10:45:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:49,973 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2024-11-03 10:45:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 10:45:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-03 10:45:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:49,975 INFO L225 Difference]: With dead ends: 124 [2024-11-03 10:45:49,975 INFO L226 Difference]: Without dead ends: 56 [2024-11-03 10:45:49,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-03 10:45:49,976 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:49,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 10:45:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-03 10:45:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-03 10:45:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-11-03 10:45:49,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 27 [2024-11-03 10:45:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:49,982 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-11-03 10:45:49,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 10:45:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-11-03 10:45:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-03 10:45:49,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:49,983 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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, 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-03 10:45:49,988 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 (4)] Ended with exit code 0 [2024-11-03 10:45:50,186 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-03 10:45:50,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:50,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:50,187 INFO L85 PathProgramCache]: Analyzing trace with hash 761216169, now seen corresponding path program 1 times [2024-11-03 10:45:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:50,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620052186] [2024-11-03 10:45:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:50,188 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-03 10:45:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:50,190 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-03 10:45:50,191 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-03 10:45:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:50,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 10:45:50,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 10:45:50,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 10:45:50,310 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620052186] [2024-11-03 10:45:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [620052186] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:50,310 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 10:45:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237387912] [2024-11-03 10:45:50,310 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:50,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 10:45:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 10:45:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:45:50,311 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:50,334 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-11-03 10:45:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:45:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-11-03 10:45:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:50,336 INFO L225 Difference]: With dead ends: 72 [2024-11-03 10:45:50,336 INFO L226 Difference]: Without dead ends: 65 [2024-11-03 10:45:50,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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-03 10:45:50,337 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:50,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 170 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-03 10:45:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-03 10:45:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-11-03 10:45:50,346 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 72 [2024-11-03 10:45:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:50,347 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-11-03 10:45:50,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:50,347 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-11-03 10:45:50,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-03 10:45:50,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:50,348 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 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, 1, 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-03 10:45:50,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-03 10:45:50,549 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-03 10:45:50,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-03 10:45:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187985084] [2024-11-03 10:45:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:50,550 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-03 10:45:50,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:50,553 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-03 10:45:50,553 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-03 10:45:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:50,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:45:50,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 10:45:50,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-03 10:45:50,685 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [187985084] [2024-11-03 10:45:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [187985084] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:50,685 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-03 10:45:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601802641] [2024-11-03 10:45:50,686 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:50,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 10:45:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 10:45:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:45:50,687 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:50,720 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-11-03 10:45:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:45:50,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-03 10:45:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:50,724 INFO L225 Difference]: With dead ends: 69 [2024-11-03 10:45:50,724 INFO L226 Difference]: Without dead ends: 63 [2024-11-03 10:45:50,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-03 10:45:50,725 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:50,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-03 10:45:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-03 10:45:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2024-11-03 10:45:50,733 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 73 [2024-11-03 10:45:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:50,736 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2024-11-03 10:45:50,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2024-11-03 10:45:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-03 10:45:50,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:50,737 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-03 10:45:50,746 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-03 10:45:50,939 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-03 10:45:50,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1231189799, now seen corresponding path program 1 times [2024-11-03 10:45:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225354404] [2024-11-03 10:45:50,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:50,941 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-03 10:45:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:50,942 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-03 10:45:50,943 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-03 10:45:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:51,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 10:45:51,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 10:45:51,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-03 10:45:51,072 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:51,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225354404] [2024-11-03 10:45:51,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1225354404] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:51,072 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:51,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 10:45:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453241834] [2024-11-03 10:45:51,073 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:51,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 10:45:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 10:45:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 10:45:51,074 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:51,125 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-03 10:45:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 10:45:51,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-03 10:45:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:51,127 INFO L225 Difference]: With dead ends: 84 [2024-11-03 10:45:51,127 INFO L226 Difference]: Without dead ends: 68 [2024-11-03 10:45:51,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-03 10:45:51,128 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:51,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-03 10:45:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-03 10:45:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 57 states have internal predecessors, (61), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-03 10:45:51,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 80 [2024-11-03 10:45:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:51,133 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-03 10:45:51,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-03 10:45:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-03 10:45:51,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:51,134 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-03 10:45:51,138 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 (7)] Ended with exit code 0 [2024-11-03 10:45:51,338 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-03 10:45:51,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:51,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -710473733, now seen corresponding path program 1 times [2024-11-03 10:45:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:51,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [298168449] [2024-11-03 10:45:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:51,339 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-03 10:45:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:51,340 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-03 10:45:51,341 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-03 10:45:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:51,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 10:45:51,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-03 10:45:51,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-03 10:45:51,542 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [298168449] [2024-11-03 10:45:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [298168449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:51,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 10:45:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415881459] [2024-11-03 10:45:51,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 10:45:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 10:45:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-03 10:45:51,544 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:51,713 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2024-11-03 10:45:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-03 10:45:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 89 [2024-11-03 10:45:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:51,714 INFO L225 Difference]: With dead ends: 109 [2024-11-03 10:45:51,714 INFO L226 Difference]: Without dead ends: 92 [2024-11-03 10:45:51,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-03 10:45:51,716 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:51,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 289 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 10:45:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-03 10:45:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2024-11-03 10:45:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 75 states have internal predecessors, (79), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-03 10:45:51,722 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 89 [2024-11-03 10:45:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:51,723 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-03 10:45:51,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-03 10:45:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-03 10:45:51,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:51,724 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-03 10:45:51,732 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 (8)] Ended with exit code 0 [2024-11-03 10:45:51,924 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-03 10:45:51,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:51,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 866534843, now seen corresponding path program 2 times [2024-11-03 10:45:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196698122] [2024-11-03 10:45:51,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:51,926 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-03 10:45:51,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:51,928 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-03 10:45:51,929 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-03 10:45:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:52,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 10:45:52,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-03 10:45:52,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 51 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-03 10:45:52,315 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:52,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196698122] [2024-11-03 10:45:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1196698122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:52,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 10:45:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975039061] [2024-11-03 10:45:52,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:52,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 10:45:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 10:45:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-03 10:45:52,317 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:52,516 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2024-11-03 10:45:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 10:45:52,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 107 [2024-11-03 10:45:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:52,517 INFO L225 Difference]: With dead ends: 115 [2024-11-03 10:45:52,517 INFO L226 Difference]: Without dead ends: 92 [2024-11-03 10:45:52,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-03 10:45:52,518 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 61 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 554 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 10:45:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-03 10:45:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-03 10:45:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 78 states have internal predecessors, (82), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-03 10:45:52,530 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 107 [2024-11-03 10:45:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:52,530 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-03 10:45:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-03 10:45:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-03 10:45:52,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:52,531 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-03 10:45:52,536 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-03 10:45:52,732 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-03 10:45:52,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:52,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1984226921, now seen corresponding path program 3 times [2024-11-03 10:45:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1880488910] [2024-11-03 10:45:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:52,733 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-03 10:45:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:52,734 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-03 10:45:52,734 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-03 10:45:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:52,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 10:45:52,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-03 10:45:52,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 4 proven. 87 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-03 10:45:53,038 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1880488910] [2024-11-03 10:45:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1880488910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:53,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-03 10:45:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869821326] [2024-11-03 10:45:53,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-03 10:45:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-03 10:45:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-03 10:45:53,040 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:53,439 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2024-11-03 10:45:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-03 10:45:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 110 [2024-11-03 10:45:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:53,441 INFO L225 Difference]: With dead ends: 150 [2024-11-03 10:45:53,441 INFO L226 Difference]: Without dead ends: 136 [2024-11-03 10:45:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2024-11-03 10:45:53,442 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:53,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 575 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 10:45:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-03 10:45:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2024-11-03 10:45:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2024-11-03 10:45:53,450 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 110 [2024-11-03 10:45:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:53,450 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2024-11-03 10:45:53,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2024-11-03 10:45:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-03 10:45:53,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:53,451 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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-03 10:45:53,456 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 (10)] Forceful destruction successful, exit code 0 [2024-11-03 10:45:53,655 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-03 10:45:53,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:53,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2129542763, now seen corresponding path program 4 times [2024-11-03 10:45:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:53,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329629573] [2024-11-03 10:45:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:53,656 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-03 10:45:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:53,657 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-03 10:45:53,658 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-03 10:45:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:53,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:45:53,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-03 10:45:53,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-11-03 10:45:53,944 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329629573] [2024-11-03 10:45:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1329629573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:53,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:53,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 10:45:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201093087] [2024-11-03 10:45:53,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:53,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 10:45:53,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:53,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 10:45:53,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 10:45:53,945 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:54,022 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2024-11-03 10:45:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 10:45:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 119 [2024-11-03 10:45:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:54,025 INFO L225 Difference]: With dead ends: 151 [2024-11-03 10:45:54,025 INFO L226 Difference]: Without dead ends: 144 [2024-11-03 10:45:54,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 230 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-03 10:45:54,026 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 30 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:54,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 360 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 10:45:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-03 10:45:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-03 10:45:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 133 states have internal predecessors, (141), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-03 10:45:54,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 119 [2024-11-03 10:45:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:54,036 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-03 10:45:54,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-03 10:45:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-03 10:45:54,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:54,037 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 6, 6, 6, 6, 6, 6, 2, 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, 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-03 10:45:54,043 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-03 10:45:54,238 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-03 10:45:54,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash 719415003, now seen corresponding path program 5 times [2024-11-03 10:45:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745017439] [2024-11-03 10:45:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:54,239 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-03 10:45:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:54,240 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-03 10:45:54,241 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-03 10:45:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:54,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 10:45:54,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 412 proven. 346 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-03 10:45:54,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 412 proven. 346 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-03 10:45:54,711 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745017439] [2024-11-03 10:45:54,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [745017439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:54,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:54,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-03 10:45:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076392956] [2024-11-03 10:45:54,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:54,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-03 10:45:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-03 10:45:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-03 10:45:54,714 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:55,115 INFO L93 Difference]: Finished difference Result 189 states and 207 transitions. [2024-11-03 10:45:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-03 10:45:55,115 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 165 [2024-11-03 10:45:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:55,116 INFO L225 Difference]: With dead ends: 189 [2024-11-03 10:45:55,116 INFO L226 Difference]: Without dead ends: 149 [2024-11-03 10:45:55,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2024-11-03 10:45:55,117 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:55,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 624 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 10:45:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-03 10:45:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-03 10:45:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 135 states have (on average 1.0666666666666667) internal successors, (144), 136 states have internal predecessors, (144), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2024-11-03 10:45:55,124 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 165 [2024-11-03 10:45:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:55,124 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2024-11-03 10:45:55,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2024-11-03 10:45:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-03 10:45:55,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:55,126 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 6, 6, 6, 6, 6, 2, 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, 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-03 10:45:55,132 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-03 10:45:55,326 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-03 10:45:55,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -232918615, now seen corresponding path program 6 times [2024-11-03 10:45:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [766074903] [2024-11-03 10:45:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:55,327 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-03 10:45:55,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:55,328 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-03 10:45:55,329 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-03 10:45:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:55,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 10:45:55,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-03 10:45:55,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 128 proven. 728 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-03 10:45:55,811 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:55,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [766074903] [2024-11-03 10:45:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [766074903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:55,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 10:45:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395889699] [2024-11-03 10:45:55,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:55,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 10:45:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 10:45:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-03 10:45:55,813 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:56,102 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2024-11-03 10:45:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-03 10:45:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 168 [2024-11-03 10:45:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:56,103 INFO L225 Difference]: With dead ends: 179 [2024-11-03 10:45:56,103 INFO L226 Difference]: Without dead ends: 162 [2024-11-03 10:45:56,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-11-03 10:45:56,104 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:56,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 630 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 10:45:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-03 10:45:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2024-11-03 10:45:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 144 states have (on average 1.0625) internal successors, (153), 145 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-03 10:45:56,115 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 168 [2024-11-03 10:45:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-03 10:45:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 states have internal predecessors, (112), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-03 10:45:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-03 10:45:56,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:56,117 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 2, 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, 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-03 10:45:56,125 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-03 10:45:56,318 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-03 10:45:56,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1416794837, now seen corresponding path program 7 times [2024-11-03 10:45:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271085057] [2024-11-03 10:45:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:56,324 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-03 10:45:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:56,326 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-03 10:45:56,329 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-03 10:45:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:56,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 10:45:56,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-03 10:45:56,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 0 proven. 1086 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-03 10:45:56,869 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271085057] [2024-11-03 10:45:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [271085057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 10:45:56,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 10:45:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 10:45:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781930579] [2024-11-03 10:45:56,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 10:45:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 10:45:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 10:45:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-03 10:45:56,871 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:56,963 INFO L93 Difference]: Finished difference Result 176 states and 192 transitions. [2024-11-03 10:45:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 10:45:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 177 [2024-11-03 10:45:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:56,964 INFO L225 Difference]: With dead ends: 176 [2024-11-03 10:45:56,964 INFO L226 Difference]: Without dead ends: 169 [2024-11-03 10:45:56,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-03 10:45:56,965 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:56,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 620 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 10:45:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-03 10:45:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2024-11-03 10:45:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.0662251655629138) internal successors, (161), 152 states have internal predecessors, (161), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-03 10:45:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2024-11-03 10:45:56,973 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 177 [2024-11-03 10:45:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:56,973 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2024-11-03 10:45:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 16 states have internal predecessors, (124), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-03 10:45:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2024-11-03 10:45:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-03 10:45:56,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:56,975 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 2, 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, 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-03 10:45:56,983 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 (14)] Forceful destruction successful, exit code 0 [2024-11-03 10:45:57,175 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-03 10:45:57,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 8 times [2024-11-03 10:45:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:57,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817748510] [2024-11-03 10:45:57,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:57,176 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-03 10:45:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:57,179 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-03 10:45:57,179 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-03 10:45:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:45:57,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 10:45:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:45:57,837 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 10:45:57,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 10:45:57,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 10:45:57,852 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-03 10:45:58,039 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-03 10:45:58,042 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1] [2024-11-03 10:45:58,091 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 10:45:58,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 10:45:58 BoogieIcfgContainer [2024-11-03 10:45:58,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 10:45:58,093 INFO L158 Benchmark]: Toolchain (without parser) took 10211.72ms. Allocated memory was 284.2MB in the beginning and 341.8MB in the end (delta: 57.7MB). Free memory was 249.3MB in the beginning and 157.1MB in the end (delta: 92.2MB). Peak memory consumption was 150.9MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,093 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 130.2kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 10:45:58,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.88ms. Allocated memory is still 284.2MB. Free memory was 249.3MB in the beginning and 235.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.40ms. Allocated memory is still 284.2MB. Free memory was 235.6MB in the beginning and 233.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,095 INFO L158 Benchmark]: Boogie Preprocessor took 33.44ms. Allocated memory is still 284.2MB. Free memory was 233.5MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,095 INFO L158 Benchmark]: RCFGBuilder took 366.06ms. Allocated memory is still 284.2MB. Free memory was 230.4MB in the beginning and 209.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,096 INFO L158 Benchmark]: TraceAbstraction took 9590.67ms. Allocated memory was 284.2MB in the beginning and 341.8MB in the end (delta: 57.7MB). Free memory was 209.4MB in the beginning and 157.1MB in the end (delta: 52.3MB). Peak memory consumption was 111.1MB. Max. memory is 8.0GB. [2024-11-03 10:45:58,096 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 130.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.88ms. Allocated memory is still 284.2MB. Free memory was 249.3MB in the beginning and 235.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.40ms. Allocated memory is still 284.2MB. Free memory was 235.6MB in the beginning and 233.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.44ms. Allocated memory is still 284.2MB. Free memory was 233.5MB in the beginning and 230.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 366.06ms. Allocated memory is still 284.2MB. Free memory was 230.4MB in the beginning and 209.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 9590.67ms. Allocated memory was 284.2MB in the beginning and 341.8MB in the end (delta: 57.7MB). Free memory was 209.4MB in the beginning and 157.1MB in the end (delta: 52.3MB). Peak memory consumption was 111.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={5:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=0] [L38] i++ VAL [d={5:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=1] [L38] i++ VAL [d={5:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=2] [L38] i++ VAL [d={5:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=3] [L38] i++ VAL [d={5:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=4] [L38] i++ VAL [d={5:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=5] [L38] i++ VAL [d={5:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={5:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={5:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={5:0}, i=6] [L38] i++ VAL [d={5:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={5:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 14, TraceHistogramMax: 28, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 5409 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4536 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1384 IncrementalHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 873 mSDtfsCounter, 1384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2526 GetRequests, 2344 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=13, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1425 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2456 ConstructedInterpolants, 0 QuantifiedInterpolants, 4726 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2558 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 4120/9016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-03 10:45:58,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...