/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/mannadiv_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:09:03,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:09:03,694 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:09:03,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:09:03,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:09:03,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:09:03,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:09:03,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:09:03,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:09:03,725 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:09:03,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:09:03,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:09:03,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:09:03,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:09:03,727 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:09:03,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:09:03,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:09:03,728 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:09:03,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:09:03,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:09:03,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:09:03,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:09:03,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:09:03,729 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:09:03,729 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:09:03,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:09:03,730 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:09:03,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:09:03,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:09:03,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:09:03,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:09:03,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:09:03,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:09:03,732 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:09:03,733 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:09:03,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:09:03,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:09:03,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:09:03,905 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:09:03,905 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:09:03,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2023-12-16 17:09:04,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:09:05,138 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:09:05,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2023-12-16 17:09:05,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523059591/b01edbe706fc4d50a477e48d29eac5f5/FLAG496080ac6 [2023-12-16 17:09:05,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523059591/b01edbe706fc4d50a477e48d29eac5f5 [2023-12-16 17:09:05,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:09:05,158 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:09:05,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:09:05,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:09:05,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:09:05,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d94f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05, skipping insertion in model container [2023-12-16 17:09:05,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,181 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:09:05,290 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/mannadiv_unwindbound5.c[573,586] [2023-12-16 17:09:05,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:09:05,307 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:09:05,315 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/mannadiv_unwindbound5.c[573,586] [2023-12-16 17:09:05,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:09:05,328 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:09:05,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05 WrapperNode [2023-12-16 17:09:05,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:09:05,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:09:05,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:09:05,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:09:05,334 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:09:05" (1/1) ... [2023-12-16 17:09:05,339 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:09:05" (1/1) ... [2023-12-16 17:09:05,349 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-12-16 17:09:05,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:09:05,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:09:05,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:09:05,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:09:05,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,366 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:09:05,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:09:05,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:09:05,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:09:05,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:09:05,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (1/1) ... [2023-12-16 17:09:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:09:05,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:09:05,399 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:09:05,431 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:09:05,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:09:05,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:09:05,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 17:09:05,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 17:09:05,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:09:05,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:09:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 17:09:05,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 17:09:05,479 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:09:05,481 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:09:05,579 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:09:05,602 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:09:05,602 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 17:09:05,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:09:05 BoogieIcfgContainer [2023-12-16 17:09:05,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:09:05,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:09:05,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:09:05,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:09:05,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:09:05" (1/3) ... [2023-12-16 17:09:05,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd32921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:09:05, skipping insertion in model container [2023-12-16 17:09:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:09:05" (2/3) ... [2023-12-16 17:09:05,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd32921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:09:05, skipping insertion in model container [2023-12-16 17:09:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:09:05" (3/3) ... [2023-12-16 17:09:05,613 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2023-12-16 17:09:05,625 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:09:05,626 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:09:05,664 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:09:05,668 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;@1fe6092a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:09:05,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:09:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:09:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 17:09:05,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:05,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:05,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:05,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2023-12-16 17:09:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973176459] [2023-12-16 17:09:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:05,690 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:09:05,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:05,692 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:09:05,740 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:09:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:05,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:09:05,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:09:05,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:09:05,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973176459] [2023-12-16 17:09:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973176459] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:09:05,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:09:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:09:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807448647] [2023-12-16 17:09:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:09:05,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:09:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:09:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:09:05,817 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 17:09:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:05,832 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2023-12-16 17:09:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:09:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-16 17:09:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:05,838 INFO L225 Difference]: With dead ends: 42 [2023-12-16 17:09:05,838 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 17:09:05,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:09:05,842 INFO L413 NwaCegarLoop]: 24 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, 24 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:09:05,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:09:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 17:09:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 17:09:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 17:09:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-16 17:09:05,865 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2023-12-16 17:09:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:05,865 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-16 17:09:05,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 17:09:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-16 17:09:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 17:09:05,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:05,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:05,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 17:09:06,070 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:09:06,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:06,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2023-12-16 17:09:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077774157] [2023-12-16 17:09:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:06,072 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:09:06,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:06,073 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:09:06,077 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:09:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:06,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 17:09:06,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:06,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:09:06,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:06,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077774157] [2023-12-16 17:09:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077774157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:09:06,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:09:06,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:09:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309402182] [2023-12-16 17:09:06,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:09:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:09:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:09:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:09:06,156 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 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:09:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:06,168 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-16 17:09:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 17:09:06,169 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), 2 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 18 [2023-12-16 17:09:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:06,169 INFO L225 Difference]: With dead ends: 29 [2023-12-16 17:09:06,170 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 17:09:06,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:09:06,171 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:06,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:09:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 17:09:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 17:09:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 17:09:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-16 17:09:06,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2023-12-16 17:09:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:06,176 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-16 17:09:06,176 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), 2 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:09:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-16 17:09:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 17:09:06,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:06,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:06,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 17:09:06,379 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:09:06,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:06,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2023-12-16 17:09:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792873038] [2023-12-16 17:09:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:06,381 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:09:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:06,386 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:09:06,400 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:09:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:06,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 17:09:06,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 17:09:06,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:06,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792873038] [2023-12-16 17:09:06,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792873038] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 17:09:06,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:09:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-16 17:09:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076620233] [2023-12-16 17:09:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:09:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:09:06,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:09:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:09:06,931 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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:09:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:08,242 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-16 17:09:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:09:08,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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 18 [2023-12-16 17:09:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:08,253 INFO L225 Difference]: With dead ends: 34 [2023-12-16 17:09:08,253 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 17:09:08,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:09:08,254 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:08,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 17:09:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 17:09:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-16 17:09:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 17:09:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-16 17:09:08,269 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2023-12-16 17:09:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:08,269 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-16 17:09:08,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (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:09:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-16 17:09:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 17:09:08,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:08,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:08,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 17:09:08,471 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:09:08,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:08,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2023-12-16 17:09:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:08,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630857748] [2023-12-16 17:09:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:08,472 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:09:08,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:08,474 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:09:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:08,508 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:09:08,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:09:08,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 17:09:08,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:09,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:09,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630857748] [2023-12-16 17:09:09,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630857748] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 17:09:09,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [919182986] [2023-12-16 17:09:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:09,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 17:09:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 17:09:09,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 17:09:09,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-16 17:09:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:09,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:09:09,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:09,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:09:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [919182986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:09:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 17:09:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2023-12-16 17:09:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603821181] [2023-12-16 17:09:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:09:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:09:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:09:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:09:09,284 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 17:09:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:09,424 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-12-16 17:09:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:09:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-16 17:09:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:09,426 INFO L225 Difference]: With dead ends: 45 [2023-12-16 17:09:09,426 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 17:09:09,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:09:09,427 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:09,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:09:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 17:09:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-12-16 17:09:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 17:09:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-16 17:09:09,433 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2023-12-16 17:09:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:09,433 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-16 17:09:09,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 17:09:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-16 17:09:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:09:09,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:09,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:09,442 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:09:09,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-16 17:09:09,835 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 17:09:09,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:09,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2023-12-16 17:09:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983390355] [2023-12-16 17:09:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:09,836 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:09:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:09,837 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:09:09,843 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:09:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:09,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:09:09,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:09,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:09,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983390355] [2023-12-16 17:09:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983390355] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:09,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 17:09:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609198849] [2023-12-16 17:09:09,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:09,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:09:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:09,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:09:09,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:09:09,990 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:09:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:10,214 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2023-12-16 17:09:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:09:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-16 17:09:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:10,216 INFO L225 Difference]: With dead ends: 91 [2023-12-16 17:09:10,216 INFO L226 Difference]: Without dead ends: 84 [2023-12-16 17:09:10,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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:09:10,217 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:10,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:09:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-16 17:09:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2023-12-16 17:09:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.305084745762712) internal successors, (77), 62 states have internal predecessors, (77), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 17:09:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2023-12-16 17:09:10,227 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 27 [2023-12-16 17:09:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:10,228 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2023-12-16 17:09:10,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:09:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2023-12-16 17:09:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:09:10,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:10,231 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:10,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 17:09:10,433 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:09:10,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:10,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1582493539, now seen corresponding path program 1 times [2023-12-16 17:09:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496530841] [2023-12-16 17:09:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:10,435 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:09:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:10,436 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:09:10,441 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:09:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:10,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 17:09:10,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 17:09:10,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:11,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496530841] [2023-12-16 17:09:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496530841] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:11,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-16 17:09:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834834009] [2023-12-16 17:09:11,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:11,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 17:09:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 17:09:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:09:11,883 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:09:15,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:09:20,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:09:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:21,298 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2023-12-16 17:09:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 17:09:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-16 17:09:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:21,302 INFO L225 Difference]: With dead ends: 133 [2023-12-16 17:09:21,303 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 17:09:21,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-16 17:09:21,304 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:21,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 126 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2023-12-16 17:09:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 17:09:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2023-12-16 17:09:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 17:09:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2023-12-16 17:09:21,317 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 27 [2023-12-16 17:09:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:21,317 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2023-12-16 17:09:21,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 17:09:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2023-12-16 17:09:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 17:09:21,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:21,323 INFO L195 NwaCegarLoop]: trace histogram [3, 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:09:21,328 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:09:21,523 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:09:21,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:21,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 943937797, now seen corresponding path program 1 times [2023-12-16 17:09:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987420726] [2023-12-16 17:09:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:21,548 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:09:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:21,550 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:09:21,555 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:09:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:21,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 17:09:21,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 17:09:21,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 17:09:23,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987420726] [2023-12-16 17:09:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987420726] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:23,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-16 17:09:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151897236] [2023-12-16 17:09:23,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:23,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 17:09:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 17:09:23,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-16 17:09:23,200 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 17:09:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:25,252 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2023-12-16 17:09:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 17:09:25,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 33 [2023-12-16 17:09:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:25,253 INFO L225 Difference]: With dead ends: 101 [2023-12-16 17:09:25,253 INFO L226 Difference]: Without dead ends: 90 [2023-12-16 17:09:25,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2023-12-16 17:09:25,254 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:25,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 125 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 17:09:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-16 17:09:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2023-12-16 17:09:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 17:09:25,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2023-12-16 17:09:25,265 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 33 [2023-12-16 17:09:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:25,266 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2023-12-16 17:09:25,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 17:09:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2023-12-16 17:09:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 17:09:25,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:25,267 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:25,272 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 (9)] Ended with exit code 0 [2023-12-16 17:09:25,468 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:09:25,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:25,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash -200746846, now seen corresponding path program 1 times [2023-12-16 17:09:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191777386] [2023-12-16 17:09:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:25,469 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:09:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:25,473 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:09:25,474 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:09:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:25,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 17:09:25,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 17:09:25,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-16 17:09:26,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191777386] [2023-12-16 17:09:26,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191777386] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:26,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:26,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 18 [2023-12-16 17:09:26,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408258277] [2023-12-16 17:09:26,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:26,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 17:09:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:26,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 17:09:26,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-12-16 17:09:26,750 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-16 17:09:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:27,892 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2023-12-16 17:09:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 17:09:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 42 [2023-12-16 17:09:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:27,895 INFO L225 Difference]: With dead ends: 103 [2023-12-16 17:09:27,895 INFO L226 Difference]: Without dead ends: 93 [2023-12-16 17:09:27,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-16 17:09:27,896 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:27,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 227 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 17:09:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-16 17:09:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2023-12-16 17:09:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 63 states have internal predecessors, (70), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 17:09:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-12-16 17:09:27,915 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 42 [2023-12-16 17:09:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:27,916 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-12-16 17:09:27,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-16 17:09:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-12-16 17:09:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 17:09:27,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:27,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:27,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-16 17:09:28,119 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:09:28,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:28,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1123591361, now seen corresponding path program 1 times [2023-12-16 17:09:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:28,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363039361] [2023-12-16 17:09:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:09:28,121 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:09:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:28,122 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:09:28,128 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:09:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:09:28,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:09:28,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 17:09:28,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 17:09:28,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363039361] [2023-12-16 17:09:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363039361] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:28,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 17:09:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308709807] [2023-12-16 17:09:28,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:09:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:09:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:09:28,268 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 17:09:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:28,431 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2023-12-16 17:09:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:09:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 45 [2023-12-16 17:09:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:28,432 INFO L225 Difference]: With dead ends: 155 [2023-12-16 17:09:28,432 INFO L226 Difference]: Without dead ends: 141 [2023-12-16 17:09:28,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:09:28,433 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:28,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:09:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-16 17:09:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2023-12-16 17:09:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 102 states have internal predecessors, (126), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 17:09:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2023-12-16 17:09:28,474 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 45 [2023-12-16 17:09:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:28,476 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2023-12-16 17:09:28,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-16 17:09:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2023-12-16 17:09:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 17:09:28,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:28,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:28,497 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:09:28,682 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:09:28,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:28,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2144659715, now seen corresponding path program 2 times [2023-12-16 17:09:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419073072] [2023-12-16 17:09:28,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:09:28,684 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:09:28,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:28,684 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:09:28,690 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:09:28,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:09:28,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:09:28,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 17:09:28,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 17:09:29,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-16 17:09:32,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419073072] [2023-12-16 17:09:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419073072] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:32,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 21 [2023-12-16 17:09:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187653168] [2023-12-16 17:09:32,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-16 17:09:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-16 17:09:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2023-12-16 17:09:32,974 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-16 17:09:35,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:09:39,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:09:43,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 17:09:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:44,890 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-12-16 17:09:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 17:09:44,890 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 45 [2023-12-16 17:09:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:44,895 INFO L225 Difference]: With dead ends: 139 [2023-12-16 17:09:44,895 INFO L226 Difference]: Without dead ends: 135 [2023-12-16 17:09:44,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2023-12-16 17:09:44,903 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:44,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 210 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2023-12-16 17:09:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-16 17:09:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2023-12-16 17:09:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 17:09:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2023-12-16 17:09:44,944 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 45 [2023-12-16 17:09:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:44,944 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2023-12-16 17:09:44,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-16 17:09:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2023-12-16 17:09:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 17:09:44,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:44,945 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:44,958 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:09:45,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:09:45,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:45,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2023-12-16 17:09:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011628727] [2023-12-16 17:09:45,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:09:45,156 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:09:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:45,157 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:09:45,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 17:09:45,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:09:45,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:09:45,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 17:09:45,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:09:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 17:09:45,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:09:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 17:09:45,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:09:45,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011628727] [2023-12-16 17:09:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011628727] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:09:45,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:09:45,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-16 17:09:45,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921338728] [2023-12-16 17:09:45,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:09:45,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:09:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:09:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:09:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:09:45,435 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-16 17:09:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:09:45,712 INFO L93 Difference]: Finished difference Result 164 states and 205 transitions. [2023-12-16 17:09:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:09:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 54 [2023-12-16 17:09:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:09:45,713 INFO L225 Difference]: With dead ends: 164 [2023-12-16 17:09:45,713 INFO L226 Difference]: Without dead ends: 159 [2023-12-16 17:09:45,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-16 17:09:45,714 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:09:45,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 275 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:09:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-16 17:09:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2023-12-16 17:09:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.2) internal successors, (150), 125 states have internal predecessors, (150), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 17:09:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2023-12-16 17:09:45,730 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 54 [2023-12-16 17:09:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:09:45,730 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2023-12-16 17:09:45,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-16 17:09:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2023-12-16 17:09:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 17:09:45,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:09:45,731 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:45,735 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 (13)] Ended with exit code 0 [2023-12-16 17:09:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:09:45,934 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:09:45,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:09:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 150356889, now seen corresponding path program 3 times [2023-12-16 17:09:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:09:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762787408] [2023-12-16 17:09:45,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:09:45,935 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:09:45,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:09:45,936 INFO L229 MonitoredProcess]: Starting monitored process 14 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:09:45,951 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 (14)] Waiting until timeout for monitored process [2023-12-16 17:09:46,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-16 17:09:46,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 17:09:46,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 17:09:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 17:09:46,161 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 17:09:46,161 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 17:09:46,162 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:09:46,171 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 17:09:46,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:09:46,366 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:09:46,368 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:09:46,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:09:46 BoogieIcfgContainer [2023-12-16 17:09:46,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:09:46,390 INFO L158 Benchmark]: Toolchain (without parser) took 41232.73ms. Allocated memory is still 231.7MB. Free memory was 192.2MB in the beginning and 102.0MB in the end (delta: 90.2MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.04ms. Allocated memory is still 231.7MB. Free memory was 192.2MB in the beginning and 180.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.57ms. Allocated memory is still 231.7MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: Boogie Preprocessor took 23.86ms. Allocated memory is still 231.7MB. Free memory was 179.1MB in the beginning and 177.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: RCFGBuilder took 228.01ms. Allocated memory is still 231.7MB. Free memory was 177.5MB in the beginning and 164.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,391 INFO L158 Benchmark]: TraceAbstraction took 40782.57ms. Allocated memory is still 231.7MB. Free memory was 163.9MB in the beginning and 102.0MB in the end (delta: 61.9MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. [2023-12-16 17:09:46,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.04ms. Allocated memory is still 231.7MB. Free memory was 192.2MB in the beginning and 180.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.57ms. Allocated memory is still 231.7MB. Free memory was 180.7MB in the beginning and 179.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.86ms. Allocated memory is still 231.7MB. Free memory was 179.1MB in the beginning and 177.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.01ms. Allocated memory is still 231.7MB. Free memory was 177.5MB in the beginning and 164.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 40782.57ms. Allocated memory is still 231.7MB. Free memory was 163.9MB in the beginning and 102.0MB in the end (delta: 61.9MB). Peak memory consumption was 63.0MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=1073741824] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=1073741824, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] EXPR counter++ VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=1073741824, x2=1, y1=0, y2=0, y3=1073741824] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] EXPR counter++ VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=1073741824, x2=1, y1=1, y2=0, y3=1073741823] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] EXPR counter++ VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=1073741824, x2=1, y1=2, y2=0, y3=1073741822] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] EXPR counter++ VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=1073741824, x2=1, y1=3, y2=0, y3=1073741821] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] EXPR counter++ VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=1073741824, x2=1, y1=4, y2=0, y3=1073741820] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] EXPR counter++ VAL [counter=6, x1=1073741824, x2=1, y1=5, y2=0, y3=1073741819] [L36] COND FALSE !(counter++<5) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=6] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=6] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 21.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1438 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1165 IncrementalHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 247 mSDtfsCounter, 1165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 693 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=11, InterpolantAutomatonStates: 112, 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, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 645 ConstructedInterpolants, 3 QuantifiedInterpolants, 2431 SizeOfPredicates, 29 NumberOfNonLiveVariables, 718 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 294/496 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 proved your program to be incorrect! [2023-12-16 17:09:46,412 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 0 Received shutdown request...