/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:01:52,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:01:52,983 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:01:52,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:01:52,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:01:53,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:01:53,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:01:53,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:01:53,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:01:53,022 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:01:53,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:01:53,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:01:53,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:01:53,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:01:53,025 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:01:53,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:01:53,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:01:53,026 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:01:53,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:01:53,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:01:53,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:01:53,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:01:53,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:01:53,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:01:53,028 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:01:53,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:01:53,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:01:53,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:01:53,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:01:53,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:01:53,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:01:53,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:01:53,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:01:53,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:01:53,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:01:53,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:01:53,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:01:53,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:01:53,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:01:53,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:01:53,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:01:53,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:01:53,032 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:01:53,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:01:53,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:01:53,033 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:01:53,033 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:01:53,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:01:53,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:01:53,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:01:53,320 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:01:53,321 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:01:53,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c [2023-12-16 17:01:54,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:01:54,758 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:01:54,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c [2023-12-16 17:01:54,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a070fea/5b9354ddee6d4c24947069b54dab44ee/FLAG4ce1f45c8 [2023-12-16 17:01:54,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20a070fea/5b9354ddee6d4c24947069b54dab44ee [2023-12-16 17:01:54,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:01:54,782 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:01:54,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:01:54,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:01:54,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:01:54,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:54,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfe8507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54, skipping insertion in model container [2023-12-16 17:01:54,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:54,815 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:01:54,931 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c[538,551] [2023-12-16 17:01:54,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:01:54,957 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:01:54,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound50.c[538,551] [2023-12-16 17:01:54,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:01:54,986 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:01:54,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54 WrapperNode [2023-12-16 17:01:54,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:01:54,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:01:54,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:01:54,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:01:54,993 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:01:54" (1/1) ... [2023-12-16 17:01:54,999 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:01:54" (1/1) ... [2023-12-16 17:01:55,016 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-16 17:01:55,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:01:55,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:01:55,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:01:55,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:01:55,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 17:01:55,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:01:55,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:01:55,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:01:55,065 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:01:55,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (1/1) ... [2023-12-16 17:01:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:01:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:01:55,103 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:01:55,105 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:01:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:01:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:01:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:01:55,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:01:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:01:55,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:01:55,181 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:01:55,183 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:01:55,661 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:01:55,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:01:55,703 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 17:01:55,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:01:55 BoogieIcfgContainer [2023-12-16 17:01:55,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:01:55,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:01:55,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:01:55,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:01:55,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:01:54" (1/3) ... [2023-12-16 17:01:55,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ed791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:01:55, skipping insertion in model container [2023-12-16 17:01:55,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:01:54" (2/3) ... [2023-12-16 17:01:55,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645ed791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:01:55, skipping insertion in model container [2023-12-16 17:01:55,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:01:55" (3/3) ... [2023-12-16 17:01:55,714 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound50.c [2023-12-16 17:01:55,730 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:01:55,731 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:01:55,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:01:55,785 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;@7e012278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:01:55,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:01:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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:01:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 17:01:55,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:55,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:55,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:55,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 65649153, now seen corresponding path program 1 times [2023-12-16 17:01:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986372700] [2023-12-16 17:01:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:55,816 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:01:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:55,820 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:01:55,827 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:01:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:55,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:01:55,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:55,948 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:01:55,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:55,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:55,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986372700] [2023-12-16 17:01:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986372700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:55,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:01:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005972420] [2023-12-16 17:01:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:01:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:01:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:01:55,988 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 4.0) internal successors, (8), 2 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:01:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:56,017 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2023-12-16 17:01:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:01:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:01:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:56,025 INFO L225 Difference]: With dead ends: 48 [2023-12-16 17:01:56,026 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 17:01:56,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:01:56,033 INFO L413 NwaCegarLoop]: 33 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, 33 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:01:56,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:01:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 17:01:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 17:01:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:01:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-12-16 17:01:56,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-12-16 17:01:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:56,069 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-12-16 17:01:56,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:01:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-12-16 17:01:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 17:01:56,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:56,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:56,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 17:01:56,275 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:01:56,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:56,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1205755883, now seen corresponding path program 1 times [2023-12-16 17:01:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574658651] [2023-12-16 17:01:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:56,279 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:01:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:56,281 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:01:56,287 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:01:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:56,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:01:56,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:56,415 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:01:56,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:56,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:56,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574658651] [2023-12-16 17:01:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574658651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:01:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261337906] [2023-12-16 17:01:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:01:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:01:56,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:01:56,420 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:01:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:56,678 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2023-12-16 17:01:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:01:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:01:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:56,681 INFO L225 Difference]: With dead ends: 37 [2023-12-16 17:01:56,681 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 17:01:56,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:01:56,683 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:01:56,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:01:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 17:01:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-12-16 17:01:56,691 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:01:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-16 17:01:56,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-12-16 17:01:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:56,693 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-16 17:01:56,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:01:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-16 17:01:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 17:01:56,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:56,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:56,699 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:01:56,896 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:01:56,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:56,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2004332404, now seen corresponding path program 1 times [2023-12-16 17:01:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095112370] [2023-12-16 17:01:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:56,898 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:01:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:56,899 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:01:56,905 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:01:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:56,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 17:01:56,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:57,001 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:01:57,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:57,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095112370] [2023-12-16 17:01:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095112370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:01:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968977503] [2023-12-16 17:01:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:57,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:01:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:01:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:01:57,005 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:57,041 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2023-12-16 17:01:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 17:01:57,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2023-12-16 17:01:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:57,045 INFO L225 Difference]: With dead ends: 43 [2023-12-16 17:01:57,045 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 17:01:57,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:01:57,049 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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:01:57,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:01:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 17:01:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 17:01:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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:01:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-16 17:01:57,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2023-12-16 17:01:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:57,062 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-16 17:01:57,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-16 17:01:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 17:01:57,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:57,064 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:57,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 17:01:57,268 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:01:57,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:57,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1962237034, now seen corresponding path program 1 times [2023-12-16 17:01:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:57,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443412743] [2023-12-16 17:01:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:57,271 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:01:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:57,272 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:01:57,274 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:01:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:57,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:01:57,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:57,364 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:01:57,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:57,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443412743] [2023-12-16 17:01:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443412743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:01:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593604754] [2023-12-16 17:01:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:01:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:01:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:01:57,368 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:01:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:57,761 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-12-16 17:01:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:01:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-16 17:01:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:57,763 INFO L225 Difference]: With dead ends: 43 [2023-12-16 17:01:57,763 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 17:01:57,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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:01:57,764 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:01:57,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 17:01:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 17:01:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2023-12-16 17:01:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 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:01:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-12-16 17:01:57,773 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2023-12-16 17:01:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:57,773 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-12-16 17:01:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 17:01:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-12-16 17:01:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 17:01:57,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:57,774 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:57,784 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:01:57,977 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:01:57,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:57,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash 608183541, now seen corresponding path program 1 times [2023-12-16 17:01:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437023303] [2023-12-16 17:01:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:57,979 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:01:57,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:57,980 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:01:57,983 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:01:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:58,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:01:58,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:58,188 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:01:58,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:58,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437023303] [2023-12-16 17:01:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437023303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:01:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277395597] [2023-12-16 17:01:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:58,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:01:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:58,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:01:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:01:58,190 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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:01:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:58,905 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2023-12-16 17:01:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:01:58,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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 19 [2023-12-16 17:01:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:58,907 INFO L225 Difference]: With dead ends: 62 [2023-12-16 17:01:58,907 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 17:01:58,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:01:58,908 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 17:01:58,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 17:01:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 17:01:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-16 17:01:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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:01:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-16 17:01:58,920 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 19 [2023-12-16 17:01:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:58,920 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-16 17:01:58,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (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:01:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-16 17:01:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:01:58,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:58,921 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:58,928 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:01:59,125 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:01:59,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:59,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 560729168, now seen corresponding path program 1 times [2023-12-16 17:01:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560414076] [2023-12-16 17:01:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:59,127 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:01:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:59,128 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:01:59,129 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:01:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:59,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:01:59,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:01:59,337 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:01:59,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:01:59,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:01:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560414076] [2023-12-16 17:01:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560414076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:01:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:01:59,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:01:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758870309] [2023-12-16 17:01:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:01:59,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:01:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:01:59,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:01:59,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:01:59,340 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 17:01:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:01:59,517 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-12-16 17:01:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:01:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-12-16 17:01:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:01:59,520 INFO L225 Difference]: With dead ends: 67 [2023-12-16 17:01:59,520 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 17:01:59,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:01:59,521 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:01:59,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:01:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 17:01:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-12-16 17:01:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 17:01:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-12-16 17:01:59,535 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 27 [2023-12-16 17:01:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:01:59,536 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-12-16 17:01:59,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 17:01:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-12-16 17:01:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:01:59,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:01:59,537 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:01:59,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:01:59,749 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:01:59,750 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:01:59,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:01:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 562457046, now seen corresponding path program 1 times [2023-12-16 17:01:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:01:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456397621] [2023-12-16 17:01:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:01:59,751 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:01:59,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:01:59,752 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:01:59,764 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:01:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:01:59,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:01:59,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:02:00,006 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:02:00,007 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:02:00,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:02:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456397621] [2023-12-16 17:02:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456397621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:02:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:02:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:02:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693168045] [2023-12-16 17:02:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:02:00,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:02:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:02:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:02:00,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:02:00,020 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:02:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:02:00,523 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-12-16 17:02:00,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:02:00,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 27 [2023-12-16 17:02:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:02:00,525 INFO L225 Difference]: With dead ends: 73 [2023-12-16 17:02:00,525 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 17:02:00,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:02:00,526 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 17:02:00,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 17:02:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 17:02:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-12-16 17:02:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 17:02:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-12-16 17:02:00,538 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 27 [2023-12-16 17:02:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:02:00,538 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-12-16 17:02:00,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:02:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-12-16 17:02:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 17:02:00,540 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:02:00,540 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, 1, 1] [2023-12-16 17:02:00,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 17:02:00,744 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:02:00,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:02:00,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:02:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 976926058, now seen corresponding path program 1 times [2023-12-16 17:02:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:02:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691931691] [2023-12-16 17:02:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:02:00,745 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:02:00,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:02:00,747 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:02:00,749 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:02:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:02:00,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:02:00,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:02:00,960 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:02:00,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:02:01,073 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:02:01,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:02:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691931691] [2023-12-16 17:02:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691931691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:02:01,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:02:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 17:02:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176529364] [2023-12-16 17:02:01,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:02:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:02:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:02:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:02:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:02:01,076 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:02:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:02:02,183 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2023-12-16 17:02:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:02:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 34 [2023-12-16 17:02:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:02:02,188 INFO L225 Difference]: With dead ends: 141 [2023-12-16 17:02:02,188 INFO L226 Difference]: Without dead ends: 116 [2023-12-16 17:02:02,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 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:02:02,189 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:02:02,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 17:02:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-16 17:02:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2023-12-16 17:02:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 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:02:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2023-12-16 17:02:02,217 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 34 [2023-12-16 17:02:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:02:02,217 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2023-12-16 17:02:02,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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:02:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2023-12-16 17:02:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 17:02:02,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:02:02,218 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:02:02,232 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:02:02,425 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:02:02,425 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:02:02,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:02:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1560293058, now seen corresponding path program 1 times [2023-12-16 17:02:02,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:02:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622321229] [2023-12-16 17:02:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:02:02,426 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:02:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:02:02,428 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:02:02,429 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:02:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:02:02,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:02:02,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:02:02,753 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:02:02,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:02:05,248 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:02:05,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:02:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622321229] [2023-12-16 17:02:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622321229] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:02:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:02:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-12-16 17:02:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740377309] [2023-12-16 17:02:05,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:02:05,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:02:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:02:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:02:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:02:05,250 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:02:08,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:02:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:02:08,635 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2023-12-16 17:02:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:02:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 37 [2023-12-16 17:02:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:02:08,637 INFO L225 Difference]: With dead ends: 126 [2023-12-16 17:02:08,637 INFO L226 Difference]: Without dead ends: 122 [2023-12-16 17:02:08,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:02:08,638 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:02:08,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 87 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-16 17:02:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-16 17:02:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2023-12-16 17:02:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 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:02:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2023-12-16 17:02:08,663 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 37 [2023-12-16 17:02:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:02:08,664 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2023-12-16 17:02:08,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:02:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2023-12-16 17:02:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 17:02:08,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:02:08,665 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, 1, 1] [2023-12-16 17:02:08,674 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:02:08,874 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:02:08,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:02:08,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:02:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash 367273510, now seen corresponding path program 1 times [2023-12-16 17:02:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:02:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350208699] [2023-12-16 17:02:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:02:08,876 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:02:08,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:02:08,877 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:02:08,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 17:02:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:02:08,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:02:08,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:02:09,257 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:02:09,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:02:09,514 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:02:09,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:02:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350208699] [2023-12-16 17:02:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350208699] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:02:09,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:02:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-16 17:02:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311424015] [2023-12-16 17:02:09,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:02:09,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 17:02:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:02:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 17:02:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:02:09,516 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:02:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:02:12,221 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2023-12-16 17:02:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:02:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 50 [2023-12-16 17:02:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:02:12,223 INFO L225 Difference]: With dead ends: 242 [2023-12-16 17:02:12,224 INFO L226 Difference]: Without dead ends: 221 [2023-12-16 17:02:12,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:02:12,225 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 73 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 17:02:12,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 195 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 17:02:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-16 17:02:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2023-12-16 17:02:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 139 states have (on average 1.1942446043165467) internal successors, (166), 148 states have internal predecessors, (166), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 17:02:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 260 transitions. [2023-12-16 17:02:12,252 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 260 transitions. Word has length 50 [2023-12-16 17:02:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:02:12,253 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 260 transitions. [2023-12-16 17:02:12,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:02:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 260 transitions. [2023-12-16 17:02:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 17:02:12,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:02:12,254 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, 1, 1] [2023-12-16 17:02:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 17:02:12,464 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:02:12,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:02:12,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:02:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -293585845, now seen corresponding path program 1 times [2023-12-16 17:02:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:02:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907722640] [2023-12-16 17:02:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:02:12,465 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:02:12,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:02:12,467 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:02:12,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 17:02:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:02:12,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 17:02:12,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:02:14,781 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:02:14,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 17:03:10,919 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:03:10,948 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 17:03:11,960 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 17:03:12,120 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 17:03:12,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 17:03:12,139 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:03:12,140 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-16 17:03:12,143 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:03:12,145 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:03:12,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:03:12 BoogieIcfgContainer [2023-12-16 17:03:12,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:03:12,147 INFO L158 Benchmark]: Toolchain (without parser) took 77365.22ms. Allocated memory was 312.5MB in the beginning and 406.8MB in the end (delta: 94.4MB). Free memory was 271.3MB in the beginning and 249.2MB in the end (delta: 22.1MB). Peak memory consumption was 117.5MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,147 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 192.9MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:03:12,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.62ms. Allocated memory is still 312.5MB. Free memory was 271.3MB in the beginning and 259.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.94ms. Allocated memory is still 312.5MB. Free memory was 259.7MB in the beginning and 258.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,148 INFO L158 Benchmark]: Boogie Preprocessor took 46.41ms. Allocated memory is still 312.5MB. Free memory was 258.2MB in the beginning and 256.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,148 INFO L158 Benchmark]: RCFGBuilder took 639.70ms. Allocated memory is still 312.5MB. Free memory was 256.1MB in the beginning and 242.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,148 INFO L158 Benchmark]: TraceAbstraction took 76438.92ms. Allocated memory was 312.5MB in the beginning and 406.8MB in the end (delta: 94.4MB). Free memory was 241.9MB in the beginning and 249.2MB in the end (delta: -7.3MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. [2023-12-16 17:03:12,149 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.55ms. Allocated memory is still 192.9MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.62ms. Allocated memory is still 312.5MB. Free memory was 271.3MB in the beginning and 259.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.94ms. Allocated memory is still 312.5MB. Free memory was 259.7MB in the beginning and 258.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.41ms. Allocated memory is still 312.5MB. Free memory was 258.2MB in the beginning and 256.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 639.70ms. Allocated memory is still 312.5MB. Free memory was 256.1MB in the beginning and 242.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 76438.92ms. Allocated memory was 312.5MB in the beginning and 406.8MB in the end (delta: 94.4MB). Free memory was 241.9MB in the beginning and 249.2MB in the end (delta: -7.3MB). Peak memory consumption was 88.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 60 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 296 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 9 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 375/432 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