/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/hard2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:03:47,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:03:47,392 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:47,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:03:47,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:03:47,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:03:47,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:03:47,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:03:47,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:03:47,421 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:03:47,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:03:47,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:03:47,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:03:47,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:03:47,423 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:03:47,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:03:47,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:03:47,423 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:03:47,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:03:47,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:03:47,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:03:47,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:03:47,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:03:47,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:03:47,430 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:03:47,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:03:47,430 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:03:47,431 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:03:47,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:03:47,431 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:03:47,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:03:47,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:03:47,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:03:47,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:03:47,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:03:47,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:03:47,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:03:47,434 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:03:47,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:03:47,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:03:47,435 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:03:47,435 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:47,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:03:47,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:03:47,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:03:47,646 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:03:47,646 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:03:47,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2023-12-16 17:03:48,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:03:48,830 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:03:48,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2023-12-16 17:03:48,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a110eb1/ebdb1ad1cc4b4318bc0016b6c006fda8/FLAG056785336 [2023-12-16 17:03:48,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5a110eb1/ebdb1ad1cc4b4318bc0016b6c006fda8 [2023-12-16 17:03:48,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:03:48,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:03:48,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:03:48,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:03:48,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:03:48,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:03:48" (1/1) ... [2023-12-16 17:03:48,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69521da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:48, skipping insertion in model container [2023-12-16 17:03:48,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:03:48" (1/1) ... [2023-12-16 17:03:48,875 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:03:48,985 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/hard2_unwindbound5.c[526,539] [2023-12-16 17:03:48,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:03:49,005 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:03:49,014 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/hard2_unwindbound5.c[526,539] [2023-12-16 17:03:49,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:03:49,029 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:03:49,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:49 WrapperNode [2023-12-16 17:03:49,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:03:49,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:03:49,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:03:49,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:03:49,035 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:49" (1/1) ... [2023-12-16 17:03:49,041 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:49" (1/1) ... [2023-12-16 17:03:49,054 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2023-12-16 17:03:49,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:03:49,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:03:49,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:03:49,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:03:49,063 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:49" (1/1) ... [2023-12-16 17:03:49,063 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:49" (1/1) ... [2023-12-16 17:03:49,064 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:49" (1/1) ... [2023-12-16 17:03:49,073 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-16 17:03:49,073 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:49" (1/1) ... [2023-12-16 17:03:49,073 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:49" (1/1) ... [2023-12-16 17:03:49,077 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:49" (1/1) ... [2023-12-16 17:03:49,079 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:49" (1/1) ... [2023-12-16 17:03:49,079 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:49" (1/1) ... [2023-12-16 17:03:49,080 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:49" (1/1) ... [2023-12-16 17:03:49,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:03:49,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:03:49,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:03:49,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:03:49,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:49" (1/1) ... [2023-12-16 17:03:49,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:03:49,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:03:49,133 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:49,138 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:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:03:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:03:49,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 17:03:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:03:49,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:03:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:03:49,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:03:49,200 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:03:49,201 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:03:49,345 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:03:49,379 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:03:49,379 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 17:03:49,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:03:49 BoogieIcfgContainer [2023-12-16 17:03:49,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:03:49,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:03:49,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:03:49,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:03:49,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:03:48" (1/3) ... [2023-12-16 17:03:49,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d88389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:03:49, skipping insertion in model container [2023-12-16 17:03:49,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:03:49" (2/3) ... [2023-12-16 17:03:49,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d88389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:03:49, skipping insertion in model container [2023-12-16 17:03:49,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:03:49" (3/3) ... [2023-12-16 17:03:49,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2023-12-16 17:03:49,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:03:49,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:03:49,437 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:03:49,442 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;@345c4e45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:03:49,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:03:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-16 17:03:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 17:03:49,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:49,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:49,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:49,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1291730102, now seen corresponding path program 1 times [2023-12-16 17:03:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219257712] [2023-12-16 17:03:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:49,474 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:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:49,490 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:49,545 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:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:49,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:03:49,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:03:49,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:49,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219257712] [2023-12-16 17:03:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219257712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:49,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:03:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398096988] [2023-12-16 17:03:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:49,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:03:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:03:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:03:49,664 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:49,682 INFO L93 Difference]: Finished difference Result 45 states and 78 transitions. [2023-12-16 17:03:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:03:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 17:03:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:49,687 INFO L225 Difference]: With dead ends: 45 [2023-12-16 17:03:49,688 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 17:03:49,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:49,691 INFO L413 NwaCegarLoop]: 31 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, 31 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:49,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 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:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 17:03:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-16 17:03:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:03:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2023-12-16 17:03:49,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 7 [2023-12-16 17:03:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:49,720 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2023-12-16 17:03:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2023-12-16 17:03:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 17:03:49,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:49,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:49,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 17:03:49,923 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:49,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:49,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash 829671692, now seen corresponding path program 1 times [2023-12-16 17:03:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373201470] [2023-12-16 17:03:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:49,925 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:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:49,926 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:49,940 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:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:49,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:03:49,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:03:50,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:50,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:50,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373201470] [2023-12-16 17:03:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373201470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:03:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083630959] [2023-12-16 17:03:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:50,064 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:50,145 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2023-12-16 17:03:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 17:03:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:50,146 INFO L225 Difference]: With dead ends: 35 [2023-12-16 17:03:50,146 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 17:03:50,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:50,147 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:50,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 90 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 17:03:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-16 17:03:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:03:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-16 17:03:50,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 7 [2023-12-16 17:03:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:50,154 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-16 17:03:50,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-16 17:03:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 17:03:50,155 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:50,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:50,159 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 (3)] Ended with exit code 0 [2023-12-16 17:03:50,355 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:50,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:50,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -166824855, now seen corresponding path program 1 times [2023-12-16 17:03:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074450633] [2023-12-16 17:03:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:50,358 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:50,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:50,359 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:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:50,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 17:03:50,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:50,387 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:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:03:50,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:50,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074450633] [2023-12-16 17:03:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074450633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:03:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432649337] [2023-12-16 17:03:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:50,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:03:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:03:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:03:50,399 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:50,423 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-12-16 17:03:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 17:03:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 17:03:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:50,424 INFO L225 Difference]: With dead ends: 41 [2023-12-16 17:03:50,424 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 17:03:50,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:03:50,425 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:50,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:03:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 17:03:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 17:03:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:03:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-16 17:03:50,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-12-16 17:03:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:50,430 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-16 17:03:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:03:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-16 17:03:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 17:03:50,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:50,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:50,439 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:50,633 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:50,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:50,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -439138420, now seen corresponding path program 1 times [2023-12-16 17:03:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017349028] [2023-12-16 17:03:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:50,634 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:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:50,640 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:50,644 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:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:50,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:03:50,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:03:50,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:50,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017349028] [2023-12-16 17:03:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017349028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:03:50,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797729291] [2023-12-16 17:03:50,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:50,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:50,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:50,704 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:03:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:50,804 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-16 17:03:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-16 17:03:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:50,805 INFO L225 Difference]: With dead ends: 41 [2023-12-16 17:03:50,805 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 17:03:50,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:50,806 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:50,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 86 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 17:03:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-12-16 17:03:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 17:03:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-12-16 17:03:50,811 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2023-12-16 17:03:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:50,811 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-12-16 17:03:50,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:03:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-12-16 17:03:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 17:03:50,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:50,812 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:50,814 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:51,013 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:51,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:51,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -235147060, now seen corresponding path program 1 times [2023-12-16 17:03:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585955644] [2023-12-16 17:03:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:51,015 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:51,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:51,017 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:51,020 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:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:51,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:03:51,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:03:51,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:51,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585955644] [2023-12-16 17:03:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585955644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:51,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:03:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934348185] [2023-12-16 17:03:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:51,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:51,132 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 17:03:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:51,299 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2023-12-16 17:03:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-16 17:03:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:51,300 INFO L225 Difference]: With dead ends: 60 [2023-12-16 17:03:51,300 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 17:03:51,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:51,301 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:51,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 17:03:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-16 17:03:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 17:03:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-16 17:03:51,308 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 17 [2023-12-16 17:03:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:51,309 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-16 17:03:51,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 17:03:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-16 17:03:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 17:03:51,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:51,309 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:51,312 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:51,512 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:51,512 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:51,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2012527405, now seen corresponding path program 1 times [2023-12-16 17:03:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301765851] [2023-12-16 17:03:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:51,513 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:51,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:51,514 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:51,515 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:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:51,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:03:51,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:03:51,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:03:51,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301765851] [2023-12-16 17:03:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301765851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:03:51,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:03:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:03:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31846658] [2023-12-16 17:03:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:51,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:03:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:03:51,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:03:51,704 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:51,840 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-12-16 17:03:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:03:51,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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 25 [2023-12-16 17:03:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:51,841 INFO L225 Difference]: With dead ends: 59 [2023-12-16 17:03:51,841 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 17:03:51,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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:51,843 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:51,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:03:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 17:03:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-16 17:03:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 17:03:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2023-12-16 17:03:51,850 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 25 [2023-12-16 17:03:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:51,850 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2023-12-16 17:03:51,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2023-12-16 17:03:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 17:03:51,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:51,851 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:51,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 17:03:52,052 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:52,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:52,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 292094342, now seen corresponding path program 1 times [2023-12-16 17:03:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:52,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410049711] [2023-12-16 17:03:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:52,053 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:52,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:52,054 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:52,057 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:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:52,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:03:52,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 17:03:52,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 17:03:52,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410049711] [2023-12-16 17:03:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410049711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:03:52,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:03:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 17:03:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129820489] [2023-12-16 17:03:52,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:03:52,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:03:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:03:52,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:03:52,265 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 17:03:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:52,559 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2023-12-16 17:03:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:03:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32 [2023-12-16 17:03:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:52,562 INFO L225 Difference]: With dead ends: 139 [2023-12-16 17:03:52,562 INFO L226 Difference]: Without dead ends: 114 [2023-12-16 17:03:52,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:03:52,563 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:52,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:03:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-16 17:03:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2023-12-16 17:03:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 72 states have internal predecessors, (84), 23 states have call successors, (23), 14 states have call predecessors, (23), 14 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 17:03:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-12-16 17:03:52,586 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 32 [2023-12-16 17:03:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:52,586 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-12-16 17:03:52,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-16 17:03:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-12-16 17:03:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 17:03:52,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:52,587 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-16 17:03:52,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 17:03:52,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:03:52,790 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:52,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash 747162997, now seen corresponding path program 1 times [2023-12-16 17:03:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124028496] [2023-12-16 17:03:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:52,791 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:52,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:52,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:03:52,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 17:03:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:52,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:03:52,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 17:03:52,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 17:03:53,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124028496] [2023-12-16 17:03:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124028496] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:03:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:03:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-16 17:03:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899527896] [2023-12-16 17:03:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:03:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:03:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:03:53,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:03:53,478 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:53,852 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2023-12-16 17:03:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:03:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 35 [2023-12-16 17:03:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:53,854 INFO L225 Difference]: With dead ends: 124 [2023-12-16 17:03:53,854 INFO L226 Difference]: Without dead ends: 120 [2023-12-16 17:03:53,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:03:53,855 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:53,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 17:03:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-16 17:03:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2023-12-16 17:03:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 79 states have internal predecessors, (90), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 17:03:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2023-12-16 17:03:53,877 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 35 [2023-12-16 17:03:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2023-12-16 17:03:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2023-12-16 17:03:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 17:03:53,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:53,882 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:53,887 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 17:03:54,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:03:54,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:54,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1125945480, now seen corresponding path program 1 times [2023-12-16 17:03:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787362720] [2023-12-16 17:03:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:54,089 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:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:54,091 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:54,100 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:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:54,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:03:54,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 17:03:54,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:03:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 17:03:54,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:03:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787362720] [2023-12-16 17:03:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787362720] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:03:54,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:03:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-16 17:03:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582966579] [2023-12-16 17:03:54,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:03:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 17:03:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:03:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 17:03:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:03:54,303 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-16 17:03:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:03:54,741 INFO L93 Difference]: Finished difference Result 193 states and 231 transitions. [2023-12-16 17:03:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:03:54,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 48 [2023-12-16 17:03:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:03:54,744 INFO L225 Difference]: With dead ends: 193 [2023-12-16 17:03:54,744 INFO L226 Difference]: Without dead ends: 172 [2023-12-16 17:03:54,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:03:54,745 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:03:54,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 184 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 17:03:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-16 17:03:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2023-12-16 17:03:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.18348623853211) internal successors, (129), 115 states have internal predecessors, (129), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-16 17:03:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2023-12-16 17:03:54,779 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 48 [2023-12-16 17:03:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:03:54,779 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2023-12-16 17:03:54,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 5 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-16 17:03:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2023-12-16 17:03:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:03:54,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:03:54,780 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:54,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 17:03:55,006 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:55,007 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:03:55,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:03:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1450073182, now seen corresponding path program 1 times [2023-12-16 17:03:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:03:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232221310] [2023-12-16 17:03:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:03:55,008 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:55,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:03:55,009 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:55,036 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:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:03:55,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 17:03:55,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:03:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 17:03:55,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:04:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 17:04:04,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:04:04,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232221310] [2023-12-16 17:04:04,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232221310] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:04:04,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:04:04,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 17:04:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140242017] [2023-12-16 17:04:04,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:04:04,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 17:04:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:04:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 17:04:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:04:04,674 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 14 states have internal predecessors, (34), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-16 17:04:13,528 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 17:04:18,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:20,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:28,019 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 39 DAG size of output: 19 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-16 17:04:33,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:37,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:42,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:46,557 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:48,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:04:53,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:05:00,281 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:05:09,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-16 17:05:09,476 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:05:09,519 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:05:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 17:05:09,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2023-12-16 17:05:09,745 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 48 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.9s IncrementalHoareTripleChecker+Time [2023-12-16 17:05:09,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 41.9s Time] [2023-12-16 17:05:09,746 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:05:09,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-16 17:05:09,947 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:05:09,948 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (167states) and FLOYD_HOARE automaton (currently 17 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (170 states constructed, input type IntersectNwa). [2023-12-16 17:05:09,951 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:05:09,953 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:05:09,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:05:09 BoogieIcfgContainer [2023-12-16 17:05:09,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:05:09,955 INFO L158 Benchmark]: Toolchain (without parser) took 81106.81ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 141.0MB in the beginning and 112.2MB in the end (delta: 28.8MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,955 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:05:09,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.04ms. Allocated memory is still 185.6MB. Free memory was 141.0MB in the beginning and 129.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.81ms. Allocated memory is still 185.6MB. Free memory was 129.1MB in the beginning and 127.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,955 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 185.6MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,955 INFO L158 Benchmark]: RCFGBuilder took 288.67ms. Allocated memory is still 185.6MB. Free memory was 125.6MB in the beginning and 112.3MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,956 INFO L158 Benchmark]: TraceAbstraction took 80572.89ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 111.6MB in the beginning and 112.2MB in the end (delta: -592.8kB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2023-12-16 17:05:09,956 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.13ms. Allocated memory is still 185.6MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.04ms. Allocated memory is still 185.6MB. Free memory was 141.0MB in the beginning and 129.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.81ms. Allocated memory is still 185.6MB. Free memory was 129.1MB in the beginning and 127.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 185.6MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 288.67ms. Allocated memory is still 185.6MB. Free memory was 125.6MB in the beginning and 112.3MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 80572.89ms. Allocated memory was 185.6MB in the beginning and 229.6MB in the end (delta: 44.0MB). Free memory was 111.6MB in the beginning and 112.2MB in the end (delta: -592.8kB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was constructing difference of abstraction (167states) and FLOYD_HOARE automaton (currently 17 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (170 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.5s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 43.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 1074 SdHoareTripleChecker+Invalid, 42.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 800 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 514 IncrementalHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 274 mSDtfsCounter, 514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 28.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 407 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 11 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 613/688 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