/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/hard-u_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:03:18,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:03:18,352 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-16 17:03:18,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:03:18,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:03:18,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:03:18,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:03:18,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:03:18,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:03:18,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:03:18,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:03:18,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:03:18,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:03:18,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:03:18,392 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:03:18,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:03:18,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:03:18,393 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:03:18,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:03:18,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:03:18,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:03:18,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:03:18,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:03:18,395 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:03:18,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:03:18,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:03:18,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:03:18,396 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:03:18,397 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:03:18,398 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-16 17:03:18,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:03:18,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:03:18,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:03:18,628 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:03:18,628 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:03:18,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2023-12-16 17:03:19,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:03:19,761 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:03:19,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound100.c [2023-12-16 17:03:19,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e39e470/d1ee38d2b2c349d5aa8d2e4ad3a356b9/FLAG08d7e3011 [2023-12-16 17:03:19,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74e39e470/d1ee38d2b2c349d5aa8d2e4ad3a356b9 [2023-12-16 17:03:19,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:03:19,779 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:03:19,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:03:19,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:03:19,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:03:19,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357e5c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19, skipping insertion in model container [2023-12-16 17:03:19,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:03:19,890 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/hard-u_valuebound100.c[537,550] [2023-12-16 17:03:19,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:03:19,909 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:03:19,917 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/hard-u_valuebound100.c[537,550] [2023-12-16 17:03:19,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:03:19,930 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:03:19,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19 WrapperNode [2023-12-16 17:03:19,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:03:19,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:03:19,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:03:19,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:03:19,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,951 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-12-16 17:03:19,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:03:19,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:03:19,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:03:19,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:03:19,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,967 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-16 17:03:19,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:03:19,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:03:19,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:03:19,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:03:19,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (1/1) ... [2023-12-16 17:03:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:03:19,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:03:20,002 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-16 17:03:20,015 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-16 17:03:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:03:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:03:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 17:03:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 17:03:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:03:20,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:03:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:03:20,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:03:20,068 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:03:20,071 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:03:20,233 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:03:20,266 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:03:20,266 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 17:03:20,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:03:20 BoogieIcfgContainer [2023-12-16 17:03:20,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:03:20,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:03:20,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:03:20,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:03:20,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:03:19" (1/3) ... [2023-12-16 17:03:20,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb2e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:03:20, skipping insertion in model container [2023-12-16 17:03:20,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:19" (2/3) ... [2023-12-16 17:03:20,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb2e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:03:20, skipping insertion in model container [2023-12-16 17:03:20,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:03:20" (3/3) ... [2023-12-16 17:03:20,276 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.c [2023-12-16 17:03:20,288 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:03:20,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:03:20,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:03:20,327 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;@46f87b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:03:20,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:03:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 17:03:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 17:03:20,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:20,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:20,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:20,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2023-12-16 17:03:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:20,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818251416] [2023-12-16 17:03:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:20,349 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-16 17:03:20,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:20,351 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-16 17:03:20,361 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-16 17:03:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:20,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:03:20,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 17:03:20,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:20,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818251416] [2023-12-16 17:03:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818251416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:03:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616577497] [2023-12-16 17:03:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:20,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:03:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:20,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:03:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:03:20,449 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 17:03:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:20,465 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2023-12-16 17:03:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:03:20,466 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-16 17:03:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:20,471 INFO L225 Difference]: With dead ends: 58 [2023-12-16 17:03:20,471 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 17:03:20,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-16 17:03:20,475 INFO L413 NwaCegarLoop]: 38 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, 38 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-16 17:03:20,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:03:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 17:03:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 17:03:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 17:03:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-16 17:03:20,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2023-12-16 17:03:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:20,496 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-16 17:03:20,496 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 17:03:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-16 17:03:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-16 17:03:20,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:20,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:20,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 17:03:20,699 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-16 17:03:20,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:20,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2023-12-16 17:03:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:20,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066533089] [2023-12-16 17:03:20,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:20,701 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-16 17:03:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:20,710 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-16 17:03:20,712 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-16 17:03:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:20,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:03:20,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:03:20,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:20,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066533089] [2023-12-16 17:03:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066533089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:20,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:03:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131600434] [2023-12-16 17:03:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:20,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:20,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:20,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:20,849 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 17:03:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:20,946 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-16 17:03:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:20,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-16 17:03:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:20,949 INFO L225 Difference]: With dead ends: 41 [2023-12-16 17:03:20,949 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 17:03:20,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-16 17:03:20,950 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:20,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 17:03:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-16 17:03:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 17:03:20,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-16 17:03:20,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-12-16 17:03:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:20,957 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-16 17:03:20,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 17:03:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-16 17:03:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 17:03:20,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:20,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:20,978 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-16 17:03:21,180 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-16 17:03:21,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:21,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2023-12-16 17:03:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701885920] [2023-12-16 17:03:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:21,185 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-16 17:03:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:21,186 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-16 17:03:21,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 17:03:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:21,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:03:21,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:03:21,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:21,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701885920] [2023-12-16 17:03:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701885920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:03:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666961596] [2023-12-16 17:03:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:21,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:21,267 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 17:03:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:21,388 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-16 17:03:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-16 17:03:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:21,389 INFO L225 Difference]: With dead ends: 45 [2023-12-16 17:03:21,389 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 17:03:21,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-16 17:03:21,390 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:21,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 17:03:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-12-16 17:03:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 17:03:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-12-16 17:03:21,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2023-12-16 17:03:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:21,398 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-12-16 17:03:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 17:03:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-12-16 17:03:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 17:03:21,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:21,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:21,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 17:03:21,609 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-16 17:03:21,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:21,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2023-12-16 17:03:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496743847] [2023-12-16 17:03:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:21,614 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-16 17:03:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:21,623 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-16 17:03:21,629 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-16 17:03:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:21,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:03:21,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 17:03:21,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 17:03:22,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:22,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496743847] [2023-12-16 17:03:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496743847] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:03:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:03:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-16 17:03:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700790938] [2023-12-16 17:03:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:22,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:03:22,069 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 17:03:26,210 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-16 17:03:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:26,413 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2023-12-16 17:03:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:03:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-16 17:03:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:26,415 INFO L225 Difference]: With dead ends: 53 [2023-12-16 17:03:26,415 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 17:03:26,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:03:26,416 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:26,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-12-16 17:03:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 17:03:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2023-12-16 17:03:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 17:03:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-12-16 17:03:26,425 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 33 [2023-12-16 17:03:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:26,426 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-12-16 17:03:26,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 17:03:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-12-16 17:03:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 17:03:26,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:26,427 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:26,430 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-16 17:03:26,629 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-16 17:03:26,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:26,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2023-12-16 17:03:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:26,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290159863] [2023-12-16 17:03:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:26,631 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-16 17:03:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:26,632 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-16 17:03:26,632 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-16 17:03:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:26,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 17:03:26,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-16 17:03:26,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 17:03:27,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290159863] [2023-12-16 17:03:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290159863] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:03:27,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:03:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-16 17:03:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749426424] [2023-12-16 17:03:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:27,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:27,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:03:27,334 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:03:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:27,645 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2023-12-16 17:03:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:03:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2023-12-16 17:03:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:27,651 INFO L225 Difference]: With dead ends: 61 [2023-12-16 17:03:27,651 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 17:03:27,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:03:27,652 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:27,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 17:03:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 17:03:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-12-16 17:03:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 17:03:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2023-12-16 17:03:27,662 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 40 [2023-12-16 17:03:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2023-12-16 17:03:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 17:03:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2023-12-16 17:03:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 17:03:27,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:27,664 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:27,667 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-16 17:03:27,867 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-16 17:03:27,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:27,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2023-12-16 17:03:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308712773] [2023-12-16 17:03:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:27,869 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-16 17:03:27,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:27,870 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-16 17:03:27,871 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-16 17:03:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:27,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:03:27,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 17:03:28,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 17:03:28,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308712773] [2023-12-16 17:03:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308712773] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:03:28,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:03:28,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-16 17:03:28,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581504699] [2023-12-16 17:03:28,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:28,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:03:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:28,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:03:28,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:03:28,720 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 17:03:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:29,144 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-12-16 17:03:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:03:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2023-12-16 17:03:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:29,146 INFO L225 Difference]: With dead ends: 69 [2023-12-16 17:03:29,146 INFO L226 Difference]: Without dead ends: 67 [2023-12-16 17:03:29,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:03:29,147 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:29,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 17:03:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-16 17:03:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2023-12-16 17:03:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 17:03:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2023-12-16 17:03:29,156 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 50 [2023-12-16 17:03:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:29,156 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2023-12-16 17:03:29,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 17:03:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2023-12-16 17:03:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 17:03:29,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:29,157 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:29,160 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-16 17:03:29,369 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-16 17:03:29,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:29,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 769340106, now seen corresponding path program 1 times [2023-12-16 17:03:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:29,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262052049] [2023-12-16 17:03:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:29,371 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-16 17:03:29,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:29,372 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-16 17:03:29,412 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-16 17:03:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:29,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:03:29,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 17:03:29,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:29,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262052049] [2023-12-16 17:03:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262052049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:03:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193569319] [2023-12-16 17:03:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:03:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:03:29,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:03:29,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-16 17:03:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:29,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:03:29,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 17:03:30,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 17:03:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [193569319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:03:31,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 17:03:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2023-12-16 17:03:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140346049] [2023-12-16 17:03:31,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 17:03:31,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:03:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:03:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:03:31,152 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-16 17:03:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:32,077 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2023-12-16 17:03:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:03:32,077 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2023-12-16 17:03:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:32,078 INFO L225 Difference]: With dead ends: 71 [2023-12-16 17:03:32,078 INFO L226 Difference]: Without dead ends: 67 [2023-12-16 17:03:32,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-16 17:03:32,079 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:32,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 123 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 17:03:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-16 17:03:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2023-12-16 17:03:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 17:03:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-12-16 17:03:32,088 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 51 [2023-12-16 17:03:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:32,088 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-12-16 17:03:32,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-16 17:03:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-12-16 17:03:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 17:03:32,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:32,089 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:32,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-16 17:03:32,306 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-16 17:03:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 17:03:32,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:32,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 974239142, now seen corresponding path program 1 times [2023-12-16 17:03:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317214400] [2023-12-16 17:03:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:32,496 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-16 17:03:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:32,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:03:32,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 17:03:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:32,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:03:32,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 17:03:32,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:32,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:32,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317214400] [2023-12-16 17:03:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317214400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:32,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:32,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:03:32,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567661837] [2023-12-16 17:03:32,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:32,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:03:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:32,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:03:32,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:03:32,625 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:03:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:32,649 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2023-12-16 17:03:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:03:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2023-12-16 17:03:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:32,669 INFO L225 Difference]: With dead ends: 93 [2023-12-16 17:03:32,669 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 17:03:32,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:03:32,671 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:32,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:03:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 17:03:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 17:03:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-16 17:03:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-12-16 17:03:32,693 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 53 [2023-12-16 17:03:32,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:32,693 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-12-16 17:03:32,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:03:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-12-16 17:03:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 17:03:32,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:32,697 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:32,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-16 17:03:32,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:03:32,903 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:32,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2023-12-16 17:03:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28807170] [2023-12-16 17:03:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:32,904 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-16 17:03:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:32,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:03:32,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 (11)] Waiting until timeout for monitored process [2023-12-16 17:03:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:32,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 17:03:32,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-16 17:03:33,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-16 17:03:38,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:38,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28807170] [2023-12-16 17:03:38,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28807170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:03:38,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:03:38,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-16 17:03:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437771388] [2023-12-16 17:03:38,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:03:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 17:03:38,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 17:03:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-12-16 17:03:38,220 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-16 17:03:45,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:03:54,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:03:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:57,760 INFO L93 Difference]: Finished difference Result 158 states and 216 transitions. [2023-12-16 17:03:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 17:03:57,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) Word has length 70 [2023-12-16 17:03:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:57,767 INFO L225 Difference]: With dead ends: 158 [2023-12-16 17:03:57,767 INFO L226 Difference]: Without dead ends: 131 [2023-12-16 17:03:57,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2023-12-16 17:03:57,769 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 102 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:57,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 311 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 368 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2023-12-16 17:03:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-16 17:03:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-12-16 17:03:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 17:03:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2023-12-16 17:03:57,815 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 70 [2023-12-16 17:03:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:57,816 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2023-12-16 17:03:57,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 11 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-16 17:03:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2023-12-16 17:03:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 17:03:57,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:57,817 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:57,822 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 17:03:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:03:58,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:58,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash 618643428, now seen corresponding path program 2 times [2023-12-16 17:03:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268628474] [2023-12-16 17:03:58,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:03:58,022 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-16 17:03:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:58,023 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:03:58,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 17:03:58,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:03:58,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:03:58,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 17:03:58,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 17:03:58,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 17:03:59,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268628474] [2023-12-16 17:03:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268628474] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:03:59,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:03:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-12-16 17:03:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315364969] [2023-12-16 17:03:59,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:03:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 17:03:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 17:03:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:03:59,520 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-12-16 17:04:06,464 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-16 17:04:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:04:07,132 INFO L93 Difference]: Finished difference Result 159 states and 213 transitions. [2023-12-16 17:04:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 17:04:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 75 [2023-12-16 17:04:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:04:07,134 INFO L225 Difference]: With dead ends: 159 [2023-12-16 17:04:07,134 INFO L226 Difference]: Without dead ends: 133 [2023-12-16 17:04:07,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-12-16 17:04:07,134 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 79 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:04:07,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 358 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 275 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2023-12-16 17:04:07,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-16 17:04:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2023-12-16 17:04:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 79 states have internal predecessors, (88), 40 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-16 17:04:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2023-12-16 17:04:07,187 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 75 [2023-12-16 17:04:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:04:07,187 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2023-12-16 17:04:07,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 12 states have internal predecessors, (36), 8 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-12-16 17:04:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2023-12-16 17:04:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-16 17:04:07,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:04:07,189 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:04:07,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-16 17:04:07,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:04:07,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:04:07,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:04:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2023-12-16 17:04:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:04:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198047589] [2023-12-16 17:04:07,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:04:07,395 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-16 17:04:07,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:04:07,396 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:04:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 17:04:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:04:07,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 17:04:07,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:04:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-16 17:04:08,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:04:10,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:04:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198047589] [2023-12-16 17:04:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198047589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:04:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1263725766] [2023-12-16 17:04:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:04:10,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:04:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:04:10,154 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:04:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-12-16 17:04:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:04:10,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 17:04:10,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:04:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 65 proven. 27 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-16 17:04:10,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 17:04:36,570 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-16 17:04:36,571 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:04:36,595 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 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:04:37,136 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:04:37,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-12-16 17:04:37,343 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 17:04:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:04:37,537 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 82 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. [2023-12-16 17:04:37,541 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:04:37,542 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:04:37,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:04:37 BoogieIcfgContainer [2023-12-16 17:04:37,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:04:37,544 INFO L158 Benchmark]: Toolchain (without parser) took 77765.73ms. Allocated memory was 190.8MB in the beginning and 269.5MB in the end (delta: 78.6MB). Free memory was 145.0MB in the beginning and 86.5MB in the end (delta: 58.6MB). Peak memory consumption was 138.2MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,544 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 147.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:04:37,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.67ms. Allocated memory is still 190.8MB. Free memory was 144.7MB in the beginning and 133.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.76ms. Allocated memory is still 190.8MB. Free memory was 133.1MB in the beginning and 131.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,545 INFO L158 Benchmark]: Boogie Preprocessor took 23.62ms. Allocated memory is still 190.8MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,545 INFO L158 Benchmark]: RCFGBuilder took 291.38ms. Allocated memory is still 190.8MB. Free memory was 129.7MB in the beginning and 117.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,545 INFO L158 Benchmark]: TraceAbstraction took 77273.31ms. Allocated memory was 190.8MB in the beginning and 269.5MB in the end (delta: 78.6MB). Free memory was 116.4MB in the beginning and 86.5MB in the end (delta: 29.9MB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. [2023-12-16 17:04:37,546 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.15ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 147.6MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 151.67ms. Allocated memory is still 190.8MB. Free memory was 144.7MB in the beginning and 133.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.76ms. Allocated memory is still 190.8MB. Free memory was 133.1MB in the beginning and 131.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.62ms. Allocated memory is still 190.8MB. Free memory was 131.8MB in the beginning and 129.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 291.38ms. Allocated memory is still 190.8MB. Free memory was 129.7MB in the beginning and 117.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 77273.31ms. Allocated memory was 190.8MB in the beginning and 269.5MB in the end (delta: 78.6MB). Free memory was 116.4MB in the beginning and 86.5MB in the end (delta: 29.9MB). Peak memory consumption was 108.9MB. 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: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 82 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.2s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 1464 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 211 mSolverCounterUnsat, 323 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 721 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=10, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 799 ConstructedInterpolants, 0 QuantifiedInterpolants, 2616 SizeOfPredicates, 26 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 1106/1178 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