/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/ps4-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:51:19,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:51:19,123 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 04:51:19,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:51:19,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:51:19,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:51:19,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:51:19,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:51:19,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:51:19,154 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:51:19,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:51:19,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:51:19,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:51:19,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:51:19,156 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:51:19,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:51:19,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:51:19,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:51:19,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:51:19,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:51:19,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:51:19,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:51:19,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:51:19,158 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:51:19,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:51:19,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:51:19,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:51:19,159 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:51:19,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:51:19,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:51:19,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:51:19,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:51:19,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:51:19,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:51:19,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:51:19,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:51:19,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:51:19,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:51:19,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:51:19,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:51:19,163 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:51:19,163 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 04:51:19,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:51:19,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:51:19,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:51:19,383 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:51:19,383 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:51:19,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2023-12-25 04:51:20,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:51:20,795 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:51:20,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound50.c [2023-12-25 04:51:20,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2e0acff/c5a87696eca44c2ebc4de7e0f0ffcd4a/FLAG6a5e85a6c [2023-12-25 04:51:20,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2e0acff/c5a87696eca44c2ebc4de7e0f0ffcd4a [2023-12-25 04:51:20,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:51:20,823 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:51:20,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:51:20,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:51:20,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:51:20,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:51:20" (1/1) ... [2023-12-25 04:51:20,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ded3961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:20, skipping insertion in model container [2023-12-25 04:51:20,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:51:20" (1/1) ... [2023-12-25 04:51:20,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:51:20,977 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/ps4-ll_valuebound50.c[458,471] [2023-12-25 04:51:20,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:51:21,004 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:51:21,015 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/ps4-ll_valuebound50.c[458,471] [2023-12-25 04:51:21,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:51:21,034 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:51:21,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21 WrapperNode [2023-12-25 04:51:21,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:51:21,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:51:21,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:51:21,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:51:21,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,065 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2023-12-25 04:51:21,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:51:21,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:51:21,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:51:21,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:51:21,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,087 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 04:51:21,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:51:21,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:51:21,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:51:21,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:51:21,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (1/1) ... [2023-12-25 04:51:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:51:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:51:21,138 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 04:51:21,143 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 04:51:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:51:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:51:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:51:21,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:51:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:51:21,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:51:21,213 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:51:21,215 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:51:21,411 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:51:21,446 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:51:21,447 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:51:21,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:51:21 BoogieIcfgContainer [2023-12-25 04:51:21,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:51:21,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:51:21,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:51:21,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:51:21,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:51:20" (1/3) ... [2023-12-25 04:51:21,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11897caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:51:21, skipping insertion in model container [2023-12-25 04:51:21,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:51:21" (2/3) ... [2023-12-25 04:51:21,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11897caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:51:21, skipping insertion in model container [2023-12-25 04:51:21,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:51:21" (3/3) ... [2023-12-25 04:51:21,454 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound50.c [2023-12-25 04:51:21,471 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:51:21,472 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:51:21,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:51:21,524 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;@4f736776, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:51:21,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:51:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:51:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 04:51:21,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:51:21,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:51:21,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:51:21,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:51:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -959206418, now seen corresponding path program 1 times [2023-12-25 04:51:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:51:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849310721] [2023-12-25 04:51:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:51:21,559 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 04:51:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:51:21,562 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 04:51:21,580 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 04:51:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:51:21,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:51:21,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:51:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:51:21,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:51:21,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:51:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849310721] [2023-12-25 04:51:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849310721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:51:21,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:51:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:51:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397513195] [2023-12-25 04:51:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:51:21,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:51:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:51:21,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:51:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:51:21,777 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 04:51:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:51:21,805 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2023-12-25 04:51:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:51:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 04:51:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:51:21,815 INFO L225 Difference]: With dead ends: 30 [2023-12-25 04:51:21,815 INFO L226 Difference]: Without dead ends: 14 [2023-12-25 04:51:21,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 04:51:21,821 INFO L413 NwaCegarLoop]: 16 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, 16 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 04:51:21,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:51:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-25 04:51:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-25 04:51:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:51:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-25 04:51:21,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2023-12-25 04:51:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:51:21,859 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-25 04:51:21,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 04:51:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-25 04:51:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 04:51:21,861 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:51:21,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:51:21,871 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 04:51:22,067 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 04:51:22,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:51:22,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:51:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash 817588404, now seen corresponding path program 1 times [2023-12-25 04:51:22,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:51:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060028940] [2023-12-25 04:51:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:51:22,070 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 04:51:22,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:51:22,071 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 04:51:22,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 04:51:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:51:22,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:51:22,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:51:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:51:22,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:51:22,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:51:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060028940] [2023-12-25 04:51:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060028940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:51:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:51:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 04:51:22,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003768486] [2023-12-25 04:51:22,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:51:22,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:51:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:51:22,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:51:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 04:51:22,305 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 04:51:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:51:23,741 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-25 04:51:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 04:51:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 04:51:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:51:23,767 INFO L225 Difference]: With dead ends: 25 [2023-12-25 04:51:23,767 INFO L226 Difference]: Without dead ends: 21 [2023-12-25 04:51:23,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 04:51:23,768 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:51:23,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 04:51:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-25 04:51:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-25 04:51:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:51:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-25 04:51:23,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2023-12-25 04:51:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:51:23,776 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-25 04:51:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 04:51:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-25 04:51:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 04:51:23,777 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:51:23,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:51:23,788 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 04:51:23,985 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 04:51:23,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:51:23,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:51:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1282095925, now seen corresponding path program 1 times [2023-12-25 04:51:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:51:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787823910] [2023-12-25 04:51:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:51:23,987 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 04:51:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:51:23,989 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 04:51:23,990 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 04:51:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:51:24,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 04:51:24,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:51:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 04:51:24,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:51:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 04:51:36,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:51:36,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787823910] [2023-12-25 04:51:36,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787823910] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:51:36,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:51:36,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 04:51:36,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661077836] [2023-12-25 04:51:36,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:51:36,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:51:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:51:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:51:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:51:36,150 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 04:51:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:51:39,817 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-12-25 04:51:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:51:39,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-25 04:51:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:51:39,838 INFO L225 Difference]: With dead ends: 27 [2023-12-25 04:51:39,839 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 04:51:39,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:51:39,840 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:51:39,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 04:51:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 04:51:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 04:51:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 04:51:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2023-12-25 04:51:39,847 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2023-12-25 04:51:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:51:39,847 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2023-12-25 04:51:39,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 04:51:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2023-12-25 04:51:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 04:51:39,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:51:39,848 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:51:39,860 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 04:51:40,060 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 04:51:40,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:51:40,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:51:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1278385288, now seen corresponding path program 1 times [2023-12-25 04:51:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:51:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870382676] [2023-12-25 04:51:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:51:40,062 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 04:51:40,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:51:40,063 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 04:51:40,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 04:51:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:51:40,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:51:40,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:51:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:51:40,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:51:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 04:51:54,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:51:54,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870382676] [2023-12-25 04:51:54,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870382676] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:51:54,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:51:54,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-25 04:51:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339609882] [2023-12-25 04:51:54,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:51:54,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:51:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:51:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:51:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:51:54,775 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:52:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:52:11,644 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-12-25 04:52:11,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 04:52:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-12-25 04:52:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:52:11,646 INFO L225 Difference]: With dead ends: 37 [2023-12-25 04:52:11,646 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 04:52:11,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:52:11,647 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:52:11,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 88 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-25 04:52:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 04:52:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-25 04:52:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:52:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-25 04:52:11,659 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2023-12-25 04:52:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:52:11,659 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-25 04:52:11,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:52:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-25 04:52:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:52:11,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:52:11,661 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:52:11,676 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 [2023-12-25 04:52:11,873 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 04:52:11,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:52:11,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:52:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -425585167, now seen corresponding path program 2 times [2023-12-25 04:52:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:52:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698694253] [2023-12-25 04:52:11,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:52:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:52:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:52:11,876 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 04:52:11,878 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 04:52:12,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:52:12,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:52:12,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:52:12,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:52:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:52:13,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:52:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 04:52:50,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:52:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698694253] [2023-12-25 04:52:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698694253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:52:50,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:52:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-25 04:52:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043808516] [2023-12-25 04:52:50,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:52:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 04:52:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:52:50,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 04:52:50,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-25 04:52:50,524 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:53:14,819 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:53:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:53:37,866 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-12-25 04:53:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 04:53:37,867 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 42 [2023-12-25 04:53:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:53:37,868 INFO L225 Difference]: With dead ends: 55 [2023-12-25 04:53:37,868 INFO L226 Difference]: Without dead ends: 49 [2023-12-25 04:53:37,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-12-25 04:53:37,869 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:53:37,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 190 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-12-25 04:53:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-25 04:53:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-25 04:53:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 04:53:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-25 04:53:37,906 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 42 [2023-12-25 04:53:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:53:37,906 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-25 04:53:37,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:53:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-25 04:53:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 04:53:37,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:53:37,909 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:53:37,933 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 04:53:38,112 WARN L477 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 [2023-12-25 04:53:38,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:53:38,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:53:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -293573039, now seen corresponding path program 3 times [2023-12-25 04:53:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:53:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886459658] [2023-12-25 04:53:38,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 04:53:38,114 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 04:53:38,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:53:38,115 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) [2023-12-25 04:53:38,116 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 [2023-12-25 04:53:43,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 04:53:43,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:53:43,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 04:53:43,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:53:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 04:53:45,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:55:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 22 proven. 165 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-25 04:55:24,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:55:24,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886459658] [2023-12-25 04:55:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886459658] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:55:24,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:55:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-25 04:55:24,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238981022] [2023-12-25 04:55:24,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:55:24,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-25 04:55:24,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:55:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-25 04:55:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2023-12-25 04:55:24,234 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 24 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 04:56:01,516 WARN L293 SmtUtils]: Spent 15.56s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:56:31,286 WARN L293 SmtUtils]: Spent 15.17s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:56:49,631 WARN L293 SmtUtils]: Spent 11.34s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:57:09,640 WARN L293 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:57:28,908 WARN L293 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:57:41,439 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:57:53,312 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:58:48,625 WARN L293 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:58:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:58:48,997 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2023-12-25 04:58:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-25 04:58:48,998 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 24 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 84 [2023-12-25 04:58:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:58:49,000 INFO L225 Difference]: With dead ends: 91 [2023-12-25 04:58:49,000 INFO L226 Difference]: Without dead ends: 85 [2023-12-25 04:58:49,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 244.3s TimeCoverageRelationStatistics Valid=704, Invalid=2488, Unknown=0, NotChecked=0, Total=3192 [2023-12-25 04:58:49,002 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 102 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:58:49,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 511 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 27.6s Time] [2023-12-25 04:58:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-25 04:58:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-25 04:58:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 24 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-25 04:58:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2023-12-25 04:58:49,037 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 84 [2023-12-25 04:58:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:58:49,037 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2023-12-25 04:58:49,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 24 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 04:58:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2023-12-25 04:58:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-25 04:58:49,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:58:49,041 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:58:49,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 04:58:49,242 WARN L477 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 [2023-12-25 04:58:49,242 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:58:49,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:58:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1923462929, now seen corresponding path program 4 times [2023-12-25 04:58:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:58:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924946160] [2023-12-25 04:58:49,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 04:58:49,243 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 04:58:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:58:49,244 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) [2023-12-25 04:58:49,245 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 [2023-12-25 04:58:54,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 04:58:54,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:58:55,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-25 04:58:55,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:58:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-25 04:58:59,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:03:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 46 proven. 759 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-25 05:03:31,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:03:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924946160] [2023-12-25 05:03:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924946160] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:03:31,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:03:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2023-12-25 05:03:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81944649] [2023-12-25 05:03:31,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:03:31,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-25 05:03:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:03:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-25 05:03:31,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=2431, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 05:03:31,819 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 56 states, 54 states have (on average 1.962962962962963) internal successors, (106), 54 states have internal predecessors, (106), 48 states have call successors, (48), 3 states have call predecessors, (48), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-25 05:05:04,545 WARN L293 SmtUtils]: Spent 40.44s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 05:06:00,296 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 05:06:00,297 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 05:06:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 05:06:00,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 280.2s TimeCoverageRelationStatistics Valid=1251, Invalid=4911, Unknown=0, NotChecked=0, Total=6162 [2023-12-25 05:06:00,436 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-12-25 05:06:00,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1449 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 29.3s Time] [2023-12-25 05:06:00,438 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:06:00,536 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 [2023-12-25 05:06:00,647 WARN L477 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 [2023-12-25 05:06:00,648 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (85states) and FLOYD_HOARE automaton (currently 32 states, 56 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-25-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-24-3-1 context. [2023-12-25 05:06:00,652 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-25 05:06:00,654 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:06:00,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:06:00 BoogieIcfgContainer [2023-12-25 05:06:00,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:06:00,656 INFO L158 Benchmark]: Toolchain (without parser) took 879832.96ms. Allocated memory is still 295.7MB. Free memory was 249.5MB in the beginning and 122.3MB in the end (delta: 127.2MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,656 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 196.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:06:00,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.44ms. Allocated memory is still 295.7MB. Free memory was 249.5MB in the beginning and 237.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.20ms. Allocated memory is still 295.7MB. Free memory was 237.9MB in the beginning and 236.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,657 INFO L158 Benchmark]: Boogie Preprocessor took 29.68ms. Allocated memory is still 295.7MB. Free memory was 236.4MB in the beginning and 234.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,658 INFO L158 Benchmark]: RCFGBuilder took 347.80ms. Allocated memory is still 295.7MB. Free memory was 234.3MB in the beginning and 222.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,658 INFO L158 Benchmark]: TraceAbstraction took 879206.59ms. Allocated memory is still 295.7MB. Free memory was 221.8MB in the beginning and 122.3MB in the end (delta: 99.4MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. [2023-12-25 05:06:00,659 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.57ms. Allocated memory is still 196.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.44ms. Allocated memory is still 295.7MB. Free memory was 249.5MB in the beginning and 237.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.20ms. Allocated memory is still 295.7MB. Free memory was 237.9MB in the beginning and 236.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.68ms. Allocated memory is still 295.7MB. Free memory was 236.4MB in the beginning and 234.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 347.80ms. Allocated memory is still 295.7MB. Free memory was 234.3MB in the beginning and 222.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 879206.59ms. Allocated memory is still 295.7MB. Free memory was 221.8MB in the beginning and 122.3MB in the end (delta: 99.4MB). Peak memory consumption was 100.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 12). Cancelled while NwaCegarLoop was constructing difference of abstraction (85states) and FLOYD_HOARE automaton (currently 32 states, 56 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-25-3-1 term,while SimplifyDDA2 was simplifying 3 xjuncts wrt. a ∧-24-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.1s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 422.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 75.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 2328 SdHoareTripleChecker+Invalid, 67.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2142 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1995 IncrementalHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 186 mSDtfsCounter, 1995 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 539 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 613.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=6, InterpolantAutomatonStates: 82, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 12.3s SatisfiabilityAnalysisTime, 442.1s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 7035 SizeOfPredicates, 18 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 2722/4638 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