/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 19:33:56,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 19:33:56,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 19:33:56,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 19:33:56,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 19:33:56,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 19:33:56,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 19:33:56,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 19:33:56,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 19:33:56,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 19:33:57,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 19:33:57,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 19:33:57,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 19:33:57,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 19:33:57,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 19:33:57,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 19:33:57,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 19:33:57,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 19:33:57,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 19:33:57,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 19:33:57,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 19:33:57,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 19:33:57,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 19:33:57,005 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 19:33:57,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 19:33:57,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 19:33:57,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 19:33:57,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 19:33:57,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 19:33:57,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:33:57,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 19:33:57,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 19:33:57,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 19:33:57,008 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 19:33:57,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 19:33:57,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 19:33:57,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 19:33:57,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 19:33:57,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 19:33:57,010 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:33:57,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 19:33:57,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 19:33:57,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 19:33:57,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 19:33:57,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 19:33:57,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-05 19:33:58,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 19:33:58,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 19:33:58,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-11-05 19:33:58,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6197fa3/98e1e93975764ad2bb5a98d6520d89c9/FLAGd79bf8b48 [2024-11-05 19:33:59,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6197fa3/98e1e93975764ad2bb5a98d6520d89c9 [2024-11-05 19:33:59,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 19:33:59,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 19:33:59,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 19:33:59,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 19:33:59,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 19:33:59,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66201208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59, skipping insertion in model container [2024-11-05 19:33:59,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 19:33:59,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2024-11-05 19:33:59,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:33:59,392 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 19:33:59,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2024-11-05 19:33:59,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 19:33:59,421 INFO L204 MainTranslator]: Completed translation [2024-11-05 19:33:59,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59 WrapperNode [2024-11-05 19:33:59,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 19:33:59,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 19:33:59,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 19:33:59,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 19:33:59,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,453 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-11-05 19:33:59,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 19:33:59,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 19:33:59,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 19:33:59,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 19:33:59,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-05 19:33:59,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 19:33:59,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 19:33:59,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 19:33:59,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 19:33:59,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (1/1) ... [2024-11-05 19:33:59,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 19:33:59,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 19:33:59,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 19:33:59,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 19:33:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 19:33:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 19:33:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 19:33:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 19:33:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 19:33:59,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 19:33:59,636 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 19:33:59,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 19:33:59,964 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 19:33:59,964 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 19:33:59,975 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 19:33:59,975 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 19:33:59,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:33:59 BoogieIcfgContainer [2024-11-05 19:33:59,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 19:33:59,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 19:33:59,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 19:33:59,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 19:33:59,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 07:33:59" (1/3) ... [2024-11-05 19:33:59,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ad02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:33:59, skipping insertion in model container [2024-11-05 19:33:59,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 07:33:59" (2/3) ... [2024-11-05 19:33:59,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0ad02d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 07:33:59, skipping insertion in model container [2024-11-05 19:33:59,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 07:33:59" (3/3) ... [2024-11-05 19:33:59,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-11-05 19:33:59,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 19:33:59,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 19:34:00,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 19:34:00,060 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;@6141e8e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 19:34:00,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 19:34:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 19:34:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 19:34:00,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:00,081 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:00,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -706627639, now seen corresponding path program 1 times [2024-11-05 19:34:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:00,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487787978] [2024-11-05 19:34:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:00,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:00,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 19:34:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:00,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 19:34:00,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-05 19:34:00,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 19:34:00,427 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487787978] [2024-11-05 19:34:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1487787978] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 19:34:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 19:34:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 19:34:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916451057] [2024-11-05 19:34:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:00,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 19:34:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 19:34:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:34:00,457 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 19:34:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:00,474 INFO L93 Difference]: Finished difference Result 55 states and 81 transitions. [2024-11-05 19:34:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 19:34:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-11-05 19:34:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:00,481 INFO L225 Difference]: With dead ends: 55 [2024-11-05 19:34:00,481 INFO L226 Difference]: Without dead ends: 27 [2024-11-05 19:34:00,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 19:34:00,486 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:00,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 19:34:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-05 19:34:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-05 19:34:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-05 19:34:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-05 19:34:00,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 40 [2024-11-05 19:34:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:00,512 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-05 19:34:00,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-05 19:34:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-05 19:34:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 19:34:00,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:00,514 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:00,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 19:34:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:00,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash -51026809, now seen corresponding path program 1 times [2024-11-05 19:34:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:00,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656125174] [2024-11-05 19:34:00,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:00,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:00,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:00,725 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:00,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 19:34:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:00,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 19:34:00,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 19:34:01,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 19:34:02,277 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656125174] [2024-11-05 19:34:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1656125174] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:34:02,277 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:34:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2024-11-05 19:34:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128996274] [2024-11-05 19:34:02,278 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:02,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 19:34:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:02,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 19:34:02,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:34:02,280 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:03,250 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2024-11-05 19:34:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 19:34:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 40 [2024-11-05 19:34:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:03,255 INFO L225 Difference]: With dead ends: 99 [2024-11-05 19:34:03,255 INFO L226 Difference]: Without dead ends: 75 [2024-11-05 19:34:03,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 19:34:03,257 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:03,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 70 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-05 19:34:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-05 19:34:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2024-11-05 19:34:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 19:34:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-05 19:34:03,267 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 40 [2024-11-05 19:34:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-05 19:34:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-05 19:34:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 19:34:03,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:03,269 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:03,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 19:34:03,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:03,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash -49179767, now seen corresponding path program 1 times [2024-11-05 19:34:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332140976] [2024-11-05 19:34:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:03,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:03,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:03,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:03,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 19:34:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:03,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 19:34:03,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 19:34:04,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 19:34:07,415 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332140976] [2024-11-05 19:34:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1332140976] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:34:07,415 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:34:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 10 [2024-11-05 19:34:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044424770] [2024-11-05 19:34:07,415 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 19:34:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 19:34:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:34:07,417 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:10,168 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-05 19:34:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 19:34:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 40 [2024-11-05 19:34:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:10,172 INFO L225 Difference]: With dead ends: 91 [2024-11-05 19:34:10,172 INFO L226 Difference]: Without dead ends: 89 [2024-11-05 19:34:10,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-05 19:34:10,174 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:10,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 176 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 19:34:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-05 19:34:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2024-11-05 19:34:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 19:34:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-05 19:34:10,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 40 [2024-11-05 19:34:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-05 19:34:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-05 19:34:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 19:34:10,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:10,184 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:10,189 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-05 19:34:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:10,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -294239510, now seen corresponding path program 1 times [2024-11-05 19:34:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2031672360] [2024-11-05 19:34:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:10,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:10,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:10,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 19:34:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:10,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 19:34:10,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-05 19:34:10,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 19:34:10,626 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2031672360] [2024-11-05 19:34:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2031672360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 19:34:10,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 19:34:10,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-05 19:34:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408779557] [2024-11-05 19:34:10,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 19:34:10,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 19:34:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 19:34:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 19:34:10,628 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 19:34:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:10,845 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2024-11-05 19:34:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 19:34:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2024-11-05 19:34:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:10,850 INFO L225 Difference]: With dead ends: 114 [2024-11-05 19:34:10,850 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 19:34:10,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-05 19:34:10,851 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:10,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 19:34:10,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 19:34:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-11-05 19:34:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 19:34:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-11-05 19:34:10,864 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 41 [2024-11-05 19:34:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:10,864 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-11-05 19:34:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 19:34:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-05 19:34:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 19:34:10,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:10,865 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:10,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 19:34:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:11,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -353344854, now seen corresponding path program 1 times [2024-11-05 19:34:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660007525] [2024-11-05 19:34:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:11,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:11,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 19:34:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:11,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 19:34:11,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 19:34:12,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 19:34:14,201 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660007525] [2024-11-05 19:34:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [660007525] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:34:14,202 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:34:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2024-11-05 19:34:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031088532] [2024-11-05 19:34:14,203 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 19:34:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 19:34:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-05 19:34:14,204 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:20,552 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-05 19:34:20,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-05 19:34:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 41 [2024-11-05 19:34:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:20,556 INFO L225 Difference]: With dead ends: 128 [2024-11-05 19:34:20,556 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 19:34:20,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2024-11-05 19:34:20,557 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 108 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:20,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 216 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-05 19:34:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 19:34:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2024-11-05 19:34:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 87 states have internal predecessors, (91), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 19:34:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2024-11-05 19:34:20,586 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 41 [2024-11-05 19:34:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:20,589 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-05 19:34:20,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-05 19:34:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2024-11-05 19:34:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 19:34:20,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:20,590 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:20,600 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 (6)] Ended with exit code 0 [2024-11-05 19:34:20,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:20,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:20,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash -102877155, now seen corresponding path program 1 times [2024-11-05 19:34:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1487483992] [2024-11-05 19:34:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:20,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:20,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 19:34:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:20,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 19:34:20,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-05 19:34:21,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-05 19:34:22,279 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:22,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1487483992] [2024-11-05 19:34:22,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1487483992] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:34:22,280 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:34:22,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2024-11-05 19:34:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307439541] [2024-11-05 19:34:22,280 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:22,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 19:34:22,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 19:34:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 19:34:22,281 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 19:34:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:22,772 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-05 19:34:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 19:34:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 78 [2024-11-05 19:34:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:22,778 INFO L225 Difference]: With dead ends: 120 [2024-11-05 19:34:22,778 INFO L226 Difference]: Without dead ends: 118 [2024-11-05 19:34:22,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-05 19:34:22,779 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:22,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 182 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 19:34:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-05 19:34:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-05 19:34:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 87 states have internal predecessors, (90), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 19:34:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2024-11-05 19:34:22,802 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 78 [2024-11-05 19:34:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:22,802 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2024-11-05 19:34:22,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-05 19:34:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2024-11-05 19:34:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 19:34:22,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 19:34:22,803 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:22,810 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-05 19:34:23,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:23,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 19:34:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 19:34:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash -101030113, now seen corresponding path program 1 times [2024-11-05 19:34:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 19:34:23,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909686922] [2024-11-05 19:34:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 19:34:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 19:34:23,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 19:34:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 19:34:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 19:34:23,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 19:34:23,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 19:34:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-05 19:34:26,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 19:34:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-05 19:34:27,098 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 19:34:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [909686922] [2024-11-05 19:34:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [909686922] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 19:34:27,098 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 19:34:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 19:34:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586665774] [2024-11-05 19:34:27,099 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 19:34:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 19:34:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 19:34:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 19:34:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 19:34:27,100 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 19:34:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 19:34:27,785 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2024-11-05 19:34:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 19:34:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 78 [2024-11-05 19:34:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 19:34:27,792 INFO L225 Difference]: With dead ends: 225 [2024-11-05 19:34:27,792 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 19:34:27,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 19:34:27,793 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 19:34:27,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-05 19:34:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 19:34:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 19:34:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 19:34:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 19:34:27,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-05 19:34:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 19:34:27,794 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 19:34:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 19:34:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 19:34:27,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 19:34:27,801 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 19:34:27,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-05 19:34:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 19:34:28,005 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-05 19:34:28,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 19:34:41,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 19:34:41,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.leq~32 [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,188 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,189 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.leq~32 [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 19:34:41,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 19:34:41,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 07:34:41 BoogieIcfgContainer [2024-11-05 19:34:41,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 19:34:41,203 INFO L158 Benchmark]: Toolchain (without parser) took 42003.27ms. Allocated memory was 216.0MB in the beginning and 412.1MB in the end (delta: 196.1MB). Free memory was 165.2MB in the beginning and 273.1MB in the end (delta: -107.9MB). Peak memory consumption was 223.0MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,203 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 216.0MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 19:34:41,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.28ms. Allocated memory is still 216.0MB. Free memory was 165.2MB in the beginning and 151.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.42ms. Allocated memory is still 216.0MB. Free memory was 151.5MB in the beginning and 149.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,204 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 216.0MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,204 INFO L158 Benchmark]: RCFGBuilder took 479.32ms. Allocated memory is still 216.0MB. Free memory was 147.7MB in the beginning and 135.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,204 INFO L158 Benchmark]: TraceAbstraction took 41225.97ms. Allocated memory was 216.0MB in the beginning and 412.1MB in the end (delta: 196.1MB). Free memory was 135.1MB in the beginning and 273.1MB in the end (delta: -138.0MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. [2024-11-05 19:34:41,205 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.45ms. Allocated memory is still 216.0MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.28ms. Allocated memory is still 216.0MB. Free memory was 165.2MB in the beginning and 151.8MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.42ms. Allocated memory is still 216.0MB. Free memory was 151.5MB in the beginning and 149.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 216.0MB. Free memory was 149.8MB in the beginning and 147.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 479.32ms. Allocated memory is still 216.0MB. Free memory was 147.7MB in the beginning and 135.8MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 41225.97ms. Allocated memory was 216.0MB in the beginning and 412.1MB in the end (delta: 196.1MB). Free memory was 135.1MB in the beginning and 273.1MB in the end (delta: -138.0MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.leq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.leq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 813 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 236 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 664 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=5, InterpolantAutomatonStates: 56, 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, 7 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 702 ConstructedInterpolants, 2 QuantifiedInterpolants, 2470 SizeOfPredicates, 37 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1168/1184 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((var_1_3 <= 0) || ((var_1_3 <= 0) && (var_1_6 == var_1_4))) || (((var_1_3 <= 0) && (((var_1_1 == 1) && (var_1_3 != 0)) || ((var_1_1 == 0) && (var_1_3 == 0)))) && (var_1_6 == var_1_4))) || ((var_1_3 <= 0) && (((var_1_1 == 1) && (var_1_3 != 0)) || ((var_1_1 == 0) && (var_1_3 == 0))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 19:34:41,256 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...