/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:13:57,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:13:58,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 02:13:58,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:13:58,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:13:58,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:13:58,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:13:58,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:13:58,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:13:58,055 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:13:58,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:13:58,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:13:58,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:13:58,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:13:58,057 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:13:58,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:13:58,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:13:58,058 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:13:58,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:13:58,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:13:58,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:13:58,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:13:58,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:13:58,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:13:58,064 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:13:58,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:13:58,065 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:13:58,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:13:58,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:13:58,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:13:58,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:13:58,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:13:58,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:13:58,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:13:58,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:13:58,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:13:58,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:13:58,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:13:58,068 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:13:58,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:13:58,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:13:58,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:13:58,072 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:13:58,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:13:58,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:13:58,072 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:13:58,072 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 [2023-12-25 02:13:58,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:13:58,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:13:58,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:13:58,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:13:58,333 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:13:58,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c [2023-12-25 02:13:59,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:13:59,744 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:13:59,747 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c [2023-12-25 02:13:59,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad606394/6fd138e4534649b8a3dab17f69d97f74/FLAG811934f94 [2023-12-25 02:13:59,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad606394/6fd138e4534649b8a3dab17f69d97f74 [2023-12-25 02:13:59,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:13:59,765 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:13:59,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:13:59,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:13:59,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:13:59,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:13:59,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0e4e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59, skipping insertion in model container [2023-12-25 02:13:59,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:13:59,795 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:13:59,913 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c[535,548] [2023-12-25 02:13:59,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:13:59,962 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:13:59,970 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound10.c[535,548] [2023-12-25 02:13:59,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:13:59,992 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:13:59,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59 WrapperNode [2023-12-25 02:13:59,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:13:59,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:13:59,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:13:59,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:14:00,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,037 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 02:14:00,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:14:00,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:14:00,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:14:00,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:14:00,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,068 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]. [2023-12-25 02:14:00,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:14:00,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:14:00,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:14:00,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:14:00,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (1/1) ... [2023-12-25 02:14:00,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:14:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:14:00,122 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) [2023-12-25 02:14:00,132 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 [2023-12-25 02:14:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:14:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:14:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:14:00,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:14:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:14:00,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:14:00,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:14:00,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:14:00,197 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:14:00,199 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:14:00,365 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:14:00,384 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:14:00,384 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-25 02:14:00,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:14:00 BoogieIcfgContainer [2023-12-25 02:14:00,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:14:00,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:14:00,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:14:00,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:14:00,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:13:59" (1/3) ... [2023-12-25 02:14:00,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba2b828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:14:00, skipping insertion in model container [2023-12-25 02:14:00,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:13:59" (2/3) ... [2023-12-25 02:14:00,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba2b828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:14:00, skipping insertion in model container [2023-12-25 02:14:00,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:14:00" (3/3) ... [2023-12-25 02:14:00,392 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound10.c [2023-12-25 02:14:00,407 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:14:00,408 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:14:00,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:14:00,446 INFO L357 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, mHoare=true, 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;@5d01154b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:14:00,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:14:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 02:14:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:14:00,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:14:00,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:14:00,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:14:00,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:14:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1294213950, now seen corresponding path program 1 times [2023-12-25 02:14:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:14:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154242376] [2023-12-25 02:14:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:14:00,485 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 [2023-12-25 02:14:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:14:00,487 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) [2023-12-25 02:14:00,490 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 [2023-12-25 02:14:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:14:00,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:14:00,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:14:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 02:14:00,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:14:00,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:14:00,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154242376] [2023-12-25 02:14:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154242376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:14:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:14:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:14:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023154753] [2023-12-25 02:14:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:14:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:14:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:14:00,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:14:00,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:14:00,686 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:14:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:14:00,712 INFO L93 Difference]: Finished difference Result 56 states and 95 transitions. [2023-12-25 02:14:00,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:14:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 02:14:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:14:00,719 INFO L225 Difference]: With dead ends: 56 [2023-12-25 02:14:00,719 INFO L226 Difference]: Without dead ends: 27 [2023-12-25 02:14:00,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:14:00,724 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:14:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:14:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-25 02:14:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-25 02:14:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 02:14:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-12-25 02:14:00,755 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 28 [2023-12-25 02:14:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:14:00,756 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-12-25 02:14:00,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 02:14:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-12-25 02:14:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 02:14:00,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:14:00,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:14:00,764 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 [2023-12-25 02:14:00,960 WARN L477 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 [2023-12-25 02:14:00,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:14:00,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:14:00,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1121299334, now seen corresponding path program 1 times [2023-12-25 02:14:00,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:14:00,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215186751] [2023-12-25 02:14:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:14:00,963 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 [2023-12-25 02:14:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:14:00,964 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) [2023-12-25 02:14:00,972 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 [2023-12-25 02:14:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:14:01,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 02:14:01,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:14:16,355 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:14:31,320 WARN L293 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:14:45,802 WARN L293 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:14:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:14:54,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:14:54,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:14:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215186751] [2023-12-25 02:14:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215186751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:14:54,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:14:54,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 02:14:54,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400103358] [2023-12-25 02:14:54,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:14:54,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 02:14:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:14:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 02:14:54,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:14:54,721 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:15:15,630 WARN L293 SmtUtils]: Spent 14.88s on a formula simplification. DAG size of input: 32 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:15:17,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:19,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:23,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:27,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:30,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:31,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:36,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:40,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:41,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:43,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:45,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:47,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:15:51,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:15:52,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:15:56,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:15:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:15:57,647 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-12-25 02:15:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 02:15:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-12-25 02:15:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:15:57,656 INFO L225 Difference]: With dead ends: 43 [2023-12-25 02:15:57,657 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 02:15:57,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 02:15:57,658 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.2s IncrementalHoareTripleChecker+Time [2023-12-25 02:15:57,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 117 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 43.2s Time] [2023-12-25 02:15:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 02:15:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-25 02:15:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 02:15:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2023-12-25 02:15:57,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 28 [2023-12-25 02:15:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:15:57,698 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2023-12-25 02:15:57,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:15:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2023-12-25 02:15:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 02:15:57,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:15:57,699 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:15:57,707 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 [2023-12-25 02:15:57,904 WARN L477 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 [2023-12-25 02:15:57,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:15:57,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:15:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1015308453, now seen corresponding path program 1 times [2023-12-25 02:15:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:15:57,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986228443] [2023-12-25 02:15:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:15:57,906 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 [2023-12-25 02:15:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:15:57,908 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) [2023-12-25 02:15:57,910 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 [2023-12-25 02:15:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:15:58,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 02:15:58,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:16:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 02:16:07,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:16:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 02:16:34,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:16:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986228443] [2023-12-25 02:16:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986228443] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:16:34,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:16:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2023-12-25 02:16:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561649497] [2023-12-25 02:16:34,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:16:34,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 02:16:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:16:34,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 02:16:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 02:16:34,580 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 02:17:02,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:17:38,273 WARN L293 SmtUtils]: Spent 11.75s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:17:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:17:38,351 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2023-12-25 02:17:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 02:17:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 34 [2023-12-25 02:17:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:17:38,373 INFO L225 Difference]: With dead ends: 51 [2023-12-25 02:17:38,373 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 02:17:38,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2023-12-25 02:17:38,374 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-12-25 02:17:38,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 134 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-12-25 02:17:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 02:17:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-25 02:17:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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) [2023-12-25 02:17:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2023-12-25 02:17:38,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 34 [2023-12-25 02:17:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:17:38,390 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2023-12-25 02:17:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 02:17:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2023-12-25 02:17:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 02:17:38,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:17:38,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:17:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 02:17:38,600 WARN L477 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 [2023-12-25 02:17:38,600 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:17:38,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:17:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1720837945, now seen corresponding path program 1 times [2023-12-25 02:17:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:17:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434429880] [2023-12-25 02:17:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:17:38,602 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 [2023-12-25 02:17:38,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:17:38,603 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) [2023-12-25 02:17:38,605 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 [2023-12-25 02:17:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:17:38,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 02:17:38,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:17:56,923 WARN L293 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:18:16,379 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:18:31,569 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:19:20,283 WARN L293 SmtUtils]: Spent 21.67s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:19:57,422 WARN L293 SmtUtils]: Spent 20.05s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:20:16,405 WARN L293 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:20:26,659 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:20:46,463 WARN L293 SmtUtils]: Spent 10.78s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:21:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 02:21:02,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:21:54,262 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 02:22:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 02:22:08,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:22:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434429880] [2023-12-25 02:22:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434429880] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 02:22:08,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 02:22:08,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 20 [2023-12-25 02:22:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28446521] [2023-12-25 02:22:08,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 02:22:08,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 02:22:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:22:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 02:22:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=315, Unknown=4, NotChecked=0, Total=380 [2023-12-25 02:22:08,159 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-25 02:22:16,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:05,404 WARN L293 SmtUtils]: Spent 33.88s on a formula simplification. DAG size of input: 41 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:23:07,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:11,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:14,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:17,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:18,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:23:21,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:24:06,927 WARN L293 SmtUtils]: Spent 26.48s on a formula simplification. DAG size of input: 44 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:24:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:24:12,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:24:15,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:24:18,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:21,631 WARN L293 SmtUtils]: Spent 47.86s on a formula simplification. DAG size of input: 48 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:25:23,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:27,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:31,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:35,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:38,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:41,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:44,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:47,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:48,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:51,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:53,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:25:56,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:01,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:02,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:24,294 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 02:26:26,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:30,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:34,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:38,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:39,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:43,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:47,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:51,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:53,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:26:57,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:01,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:05,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:09,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:12,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:15,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:18,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:22,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:26,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:28,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:30,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:34,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:36,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:39,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:40,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:43,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:48,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:50,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:54,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:27:56,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:28:02,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:28:07,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:28:09,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 02:28:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:28:09,656 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2023-12-25 02:28:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 02:28:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 42 [2023-12-25 02:28:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:28:09,687 INFO L225 Difference]: With dead ends: 84 [2023-12-25 02:28:09,687 INFO L226 Difference]: Without dead ends: 69 [2023-12-25 02:28:09,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 323.3s TimeCoverageRelationStatistics Valid=121, Invalid=576, Unknown=5, NotChecked=0, Total=702 [2023-12-25 02:28:09,689 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 54 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 179.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.6s IncrementalHoareTripleChecker+Time [2023-12-25 02:28:09,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 186 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 181.6s Time] [2023-12-25 02:28:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-25 02:28:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-12-25 02:28:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 46 states have internal predecessors, (51), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 02:28:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2023-12-25 02:28:09,714 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 42 [2023-12-25 02:28:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:28:09,714 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2023-12-25 02:28:09,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 9 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-25 02:28:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2023-12-25 02:28:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 02:28:09,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:28:09,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:28:09,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 02:28:09,924 WARN L477 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 [2023-12-25 02:28:09,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:28:09,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:28:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash -852075680, now seen corresponding path program 1 times [2023-12-25 02:28:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:28:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335037224] [2023-12-25 02:28:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:28:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 02:28:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:28:09,927 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) [2023-12-25 02:28:09,928 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 [2023-12-25 02:28:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:28:10,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 02:28:10,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:28:29,538 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 02:28:42,710 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:28:42,735 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 02:28:43,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 02:28:43,911 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 02:28:43,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 02:28:43,927 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 02:28:43,928 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 50 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-25 02:28:43,931 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 02:28:43,933 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 02:28:43,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 02:28:43 BoogieIcfgContainer [2023-12-25 02:28:43,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 02:28:43,935 INFO L158 Benchmark]: Toolchain (without parser) took 884169.20ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 142.8MB in the beginning and 80.3MB in the end (delta: 62.5MB). Peak memory consumption was 111.2MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,935 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 191.9MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 02:28:43,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.93ms. Allocated memory is still 191.9MB. Free memory was 142.4MB in the beginning and 130.1MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.71ms. Allocated memory is still 191.9MB. Free memory was 130.1MB in the beginning and 128.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,936 INFO L158 Benchmark]: Boogie Preprocessor took 44.52ms. Allocated memory is still 191.9MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,936 INFO L158 Benchmark]: RCFGBuilder took 301.09ms. Allocated memory is still 191.9MB. Free memory was 126.3MB in the beginning and 112.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,936 INFO L158 Benchmark]: TraceAbstraction took 883547.22ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 112.3MB in the beginning and 80.3MB in the end (delta: 32.0MB). Peak memory consumption was 80.8MB. Max. memory is 8.0GB. [2023-12-25 02:28:43,937 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.16ms. Allocated memory is still 191.9MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.93ms. Allocated memory is still 191.9MB. Free memory was 142.4MB in the beginning and 130.1MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.71ms. Allocated memory is still 191.9MB. Free memory was 130.1MB in the beginning and 128.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.52ms. Allocated memory is still 191.9MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 301.09ms. Allocated memory is still 191.9MB. Free memory was 126.3MB in the beginning and 112.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 883547.22ms. Allocated memory was 191.9MB in the beginning and 239.1MB in the end (delta: 47.2MB). Free memory was 112.3MB in the beginning and 80.3MB in the end (delta: 32.0MB). Peak memory consumption was 80.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was analyzing trace of length 50 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 488.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 239.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 235.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 94 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 444.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 359.5s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 202 ConstructedInterpolants, 14 QuantifiedInterpolants, 1502 SizeOfPredicates, 20 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 150/168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown