/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/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:46:07,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:46:07,889 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 16:46:07,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:46:07,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:46:07,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:46:07,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:46:07,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:46:07,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:46:07,917 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:46:07,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:46:07,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:46:07,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:46:07,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:46:07,919 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:46:07,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:46:07,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:46:07,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:46:07,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:46:07,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:46:07,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:46:07,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:46:07,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:46:07,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:46:07,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:46:07,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:46:07,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:46:07,923 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:46:07,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:46:07,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:46:07,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:46:07,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:46:07,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:46:07,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:46:07,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:46:07,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:46:07,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:46:07,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:46:07,926 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:46:07,926 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 16:46:08,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:46:08,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:46:08,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:46:08,126 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:46:08,127 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:46:08,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2023-12-16 16:46:09,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:46:09,309 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:46:09,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2023-12-16 16:46:09,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3d8b53f/601616e603a7444fb6756c1b649e8875/FLAG25b41bb98 [2023-12-16 16:46:09,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3d8b53f/601616e603a7444fb6756c1b649e8875 [2023-12-16 16:46:09,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:46:09,335 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:46:09,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:46:09,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:46:09,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:46:09,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7340e571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09, skipping insertion in model container [2023-12-16 16:46:09,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:46:09,472 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/dijkstra-u_unwindbound2.c[525,538] [2023-12-16 16:46:09,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:46:09,512 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:46:09,520 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/dijkstra-u_unwindbound2.c[525,538] [2023-12-16 16:46:09,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:46:09,540 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:46:09,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09 WrapperNode [2023-12-16 16:46:09,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:46:09,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:46:09,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:46:09,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:46:09,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,572 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-12-16 16:46:09,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:46:09,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:46:09,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:46:09,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:46:09,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,612 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 16:46:09,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,625 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:46:09,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:46:09,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:46:09,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:46:09,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (1/1) ... [2023-12-16 16:46:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:46:09,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:46:09,664 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 16:46:09,693 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 16:46:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:46:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:46:09,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:46:09,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:46:09,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:46:09,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:46:09,762 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:46:09,764 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:46:09,952 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:46:09,979 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:46:09,979 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:46:09,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:09 BoogieIcfgContainer [2023-12-16 16:46:09,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:46:09,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:46:09,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:46:09,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:46:09,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:46:09" (1/3) ... [2023-12-16 16:46:09,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c84bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:09, skipping insertion in model container [2023-12-16 16:46:09,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:46:09" (2/3) ... [2023-12-16 16:46:09,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c84bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:46:09, skipping insertion in model container [2023-12-16 16:46:09,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:46:09" (3/3) ... [2023-12-16 16:46:09,985 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2023-12-16 16:46:09,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:46:09,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:46:10,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:46:10,038 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;@1322183f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:46:10,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:46:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 16:46:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:46:10,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:10,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:10,051 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:10,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2020981481, now seen corresponding path program 1 times [2023-12-16 16:46:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586513133] [2023-12-16 16:46:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:10,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:46:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:10,063 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 16:46:10,066 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 16:46:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:10,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:46:10,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:10,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:10,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:10,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586513133] [2023-12-16 16:46:10,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586513133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:46:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140475983] [2023-12-16 16:46:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:46:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:10,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:46:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:46:10,198 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:10,220 INFO L93 Difference]: Finished difference Result 52 states and 92 transitions. [2023-12-16 16:46:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:46:10,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:46:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:10,226 INFO L225 Difference]: With dead ends: 52 [2023-12-16 16:46:10,226 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 16:46:10,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:46:10,230 INFO L413 NwaCegarLoop]: 37 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, 37 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 16:46:10,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 16:46:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-16 16:46:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2023-12-16 16:46:10,253 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 9 [2023-12-16 16:46:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:10,253 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2023-12-16 16:46:10,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2023-12-16 16:46:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:46:10,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:10,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:10,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:10,457 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 16:46:10,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:10,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash 10324464, now seen corresponding path program 1 times [2023-12-16 16:46:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778514552] [2023-12-16 16:46:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:10,459 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 16:46:10,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:10,459 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 16:46:10,461 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 16:46:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:10,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:46:10,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:10,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:10,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778514552] [2023-12-16 16:46:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778514552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:46:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693290336] [2023-12-16 16:46:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:46:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:10,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:46:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:46:10,566 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:10,586 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-12-16 16:46:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:46:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-16 16:46:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:10,588 INFO L225 Difference]: With dead ends: 46 [2023-12-16 16:46:10,588 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:46:10,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:46:10,590 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:10,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:46:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 16:46:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2023-12-16 16:46:10,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 11 [2023-12-16 16:46:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:10,595 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2023-12-16 16:46:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2023-12-16 16:46:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:46:10,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:10,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:10,602 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 16:46:10,802 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 16:46:10,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:10,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash -21038528, now seen corresponding path program 1 times [2023-12-16 16:46:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:10,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232672090] [2023-12-16 16:46:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:10,804 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 16:46:10,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:10,805 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 16:46:10,807 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 16:46:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:10,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:46:10,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:10,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:10,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:10,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232672090] [2023-12-16 16:46:10,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232672090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:10,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:10,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:46:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952493429] [2023-12-16 16:46:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:10,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:46:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:46:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:46:10,888 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:10,906 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-16 16:46:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:46:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:46:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:10,907 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:46:10,907 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 16:46:10,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:46:10,908 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 16:46:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2023-12-16 16:46:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 16:46:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2023-12-16 16:46:10,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 12 [2023-12-16 16:46:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:10,913 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2023-12-16 16:46:10,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2023-12-16 16:46:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:46:10,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:10,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:10,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:11,117 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 16:46:11,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:11,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -19548978, now seen corresponding path program 1 times [2023-12-16 16:46:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919839033] [2023-12-16 16:46:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:11,119 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 16:46:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:11,123 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 16:46:11,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:46:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:11,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:46:11,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:11,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:11,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919839033] [2023-12-16 16:46:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919839033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:46:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011016182] [2023-12-16 16:46:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:11,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:46:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:46:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:46:11,368 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:14,576 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2023-12-16 16:46:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:46:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-16 16:46:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:14,588 INFO L225 Difference]: With dead ends: 63 [2023-12-16 16:46:14,588 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 16:46:14,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:46:14,589 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 185 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-16 16:46:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 16:46:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 16:46:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 16:46:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2023-12-16 16:46:14,597 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2023-12-16 16:46:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:14,597 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2023-12-16 16:46:14,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2023-12-16 16:46:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 16:46:14,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:14,598 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:14,600 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:14,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:46:14,800 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:14,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1459140795, now seen corresponding path program 1 times [2023-12-16 16:46:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508838298] [2023-12-16 16:46:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:14,801 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 16:46:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:14,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:46:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:46:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:14,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:46:14,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:14,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:15,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508838298] [2023-12-16 16:46:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508838298] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:15,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 16:46:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905140669] [2023-12-16 16:46:15,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:15,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:46:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:15,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:46:15,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:46:15,016 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:15,110 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2023-12-16 16:46:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:46:15,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-16 16:46:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:15,112 INFO L225 Difference]: With dead ends: 63 [2023-12-16 16:46:15,112 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 16:46:15,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:46:15,113 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:15,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:46:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 16:46:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-16 16:46:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 16:46:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-12-16 16:46:15,119 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 14 [2023-12-16 16:46:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:15,120 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-12-16 16:46:15,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-12-16 16:46:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:46:15,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:15,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:15,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:46:15,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:15,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1670178699, now seen corresponding path program 1 times [2023-12-16 16:46:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:15,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220003966] [2023-12-16 16:46:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:15,322 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 16:46:15,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:15,323 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 16:46:15,324 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 16:46:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:15,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:46:15,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 16:46:15,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:46:15,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220003966] [2023-12-16 16:46:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220003966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:46:15,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:46:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:46:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979932181] [2023-12-16 16:46:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:46:15,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:46:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:46:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:46:15,505 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:17,268 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2023-12-16 16:46:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:46:17,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:46:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:17,291 INFO L225 Difference]: With dead ends: 66 [2023-12-16 16:46:17,291 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 16:46:17,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:46:17,291 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:17,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 16:46:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 16:46:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-16 16:46:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 27 states have internal predecessors, (33), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 16:46:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2023-12-16 16:46:17,310 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 15 [2023-12-16 16:46:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:17,310 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2023-12-16 16:46:17,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2023-12-16 16:46:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:46:17,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:17,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:17,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:17,517 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 16:46:17,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:17,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1671668249, now seen corresponding path program 1 times [2023-12-16 16:46:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135548810] [2023-12-16 16:46:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:17,518 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 16:46:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:17,519 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 16:46:17,520 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 16:46:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:17,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:46:17,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:17,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:17,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:17,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135548810] [2023-12-16 16:46:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135548810] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:17,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 16:46:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522950845] [2023-12-16 16:46:17,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:17,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:46:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:46:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:46:17,788 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:18,791 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2023-12-16 16:46:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:46:18,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:46:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:18,793 INFO L225 Difference]: With dead ends: 132 [2023-12-16 16:46:18,793 INFO L226 Difference]: Without dead ends: 94 [2023-12-16 16:46:18,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:46:18,794 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:18,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 16:46:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-16 16:46:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2023-12-16 16:46:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 46 states have internal predecessors, (59), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 16:46:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2023-12-16 16:46:18,801 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 15 [2023-12-16 16:46:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:18,801 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2023-12-16 16:46:18,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2023-12-16 16:46:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 16:46:18,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:18,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:18,808 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 16:46:19,002 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 16:46:19,002 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:19,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 648412342, now seen corresponding path program 1 times [2023-12-16 16:46:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:19,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046547891] [2023-12-16 16:46:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:19,003 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 16:46:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:19,004 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 16:46:19,007 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 16:46:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:19,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:46:19,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:19,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:46:21,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046547891] [2023-12-16 16:46:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046547891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:21,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-16 16:46:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021978109] [2023-12-16 16:46:21,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:21,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:46:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:46:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:46:21,040 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:46:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:26,373 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2023-12-16 16:46:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:46:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-16 16:46:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:26,376 INFO L225 Difference]: With dead ends: 77 [2023-12-16 16:46:26,376 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 16:46:26,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:46:26,380 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:26,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 219 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-16 16:46:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 16:46:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-16 16:46:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 16:46:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2023-12-16 16:46:26,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 20 [2023-12-16 16:46:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:26,389 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2023-12-16 16:46:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:46:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2023-12-16 16:46:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:46:26,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:46:26,390 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:26,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:26,592 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 16:46:26,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:46:26,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:46:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash -455849453, now seen corresponding path program 1 times [2023-12-16 16:46:26,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:46:26,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280700316] [2023-12-16 16:46:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:46:26,593 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 16:46:26,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:46:26,594 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 16:46:26,594 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 16:46:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:46:26,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:46:26,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:46:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-16 16:46:26,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:46:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-16 16:46:26,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:46:26,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280700316] [2023-12-16 16:46:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280700316] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:46:26,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:46:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 16:46:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055217992] [2023-12-16 16:46:26,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:46:26,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:46:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:46:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:46:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:46:26,830 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:46:26,895 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2023-12-16 16:46:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:46:26,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 16:46:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:46:26,895 INFO L225 Difference]: With dead ends: 53 [2023-12-16 16:46:26,895 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:46:26,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-16 16:46:26,896 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:46:26,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:46:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:46:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:46:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:46:26,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2023-12-16 16:46:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:46:26,897 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:46:26,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:46:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:46:26,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:46:26,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:46:26,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:46:27,101 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 16:46:27,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:46:27,850 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-12-16 16:46:27,851 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 55) no Hoare annotation was computed. [2023-12-16 16:46:27,851 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32))) (.cse1 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32)))) (or (and (not (bvslt ~counter~0 (_ bv2 32))) (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) .cse0 .cse1) (and (= ~counter~0 (_ bv1 32)) (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse0 .cse1))) [2023-12-16 16:46:27,851 INFO L899 garLoopResultBuilder]: For program point L44(lines 38 56) no Hoare annotation was computed. [2023-12-16 16:46:27,853 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,854 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)))) (or (and (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) .cse0 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse0))) [2023-12-16 16:46:27,854 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,854 INFO L899 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2023-12-16 16:46:27,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:46:27,854 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)))) (or (and (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) .cse0 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse0))) [2023-12-16 16:46:27,854 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,854 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:46:27,855 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-12-16 16:46:27,855 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 56) no Hoare annotation was computed. [2023-12-16 16:46:27,855 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (and (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64)) (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,855 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2023-12-16 16:46:27,855 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse1 (bvslt ((_ zero_extend 32) |ULTIMATE.start_main_~n~0#1|) (_ bv1073741823 64))) (.cse2 (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32)))) (or (and .cse0 (= ~counter~0 (_ bv0 32)) .cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) .cse2 .cse3) (and (= ~counter~0 (_ bv1 32)) (= (_ bv4 32) |ULTIMATE.start_main_~q~0#1|) .cse0 (bvule (_ bv1 32) |ULTIMATE.start_main_~n~0#1|) .cse1 .cse2 .cse3) (and (= (_ bv2 32) ~counter~0) .cse1 (= (bvadd (bvneg |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~r~0#1|) (_ bv0 32)) .cse2 .cse3))) [2023-12-16 16:46:27,855 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-16 16:46:27,855 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,855 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,855 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (and (not (bvule (_ bv1 32) |ULTIMATE.start_main_~r~0#1|)) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~h~0#1| (_ bv0 32))) [2023-12-16 16:46:27,855 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-12-16 16:46:27,856 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-12-16 16:46:27,856 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-12-16 16:46:27,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-12-16 16:46:27,856 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-12-16 16:46:27,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-12-16 16:46:27,858 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:46:27,860 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:46:27,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:46:27 BoogieIcfgContainer [2023-12-16 16:46:27,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:46:27,869 INFO L158 Benchmark]: Toolchain (without parser) took 18533.98ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 140.3MB in the beginning and 136.9MB in the end (delta: 3.4MB). Peak memory consumption was 50.7MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,869 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 205.5MB. Free memory was 154.5MB in the beginning and 154.3MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:46:27,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.91ms. Allocated memory is still 205.5MB. Free memory was 140.3MB in the beginning and 127.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.41ms. Allocated memory is still 205.5MB. Free memory was 127.6MB in the beginning and 125.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,870 INFO L158 Benchmark]: Boogie Preprocessor took 58.68ms. Allocated memory is still 205.5MB. Free memory was 125.7MB in the beginning and 123.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,870 INFO L158 Benchmark]: RCFGBuilder took 348.08ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 123.6MB in the beginning and 202.5MB in the end (delta: -78.9MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,870 INFO L158 Benchmark]: TraceAbstraction took 17887.67ms. Allocated memory is still 251.7MB. Free memory was 202.0MB in the beginning and 136.9MB in the end (delta: 65.1MB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. [2023-12-16 16:46:27,872 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.43ms. Allocated memory is still 205.5MB. Free memory was 154.5MB in the beginning and 154.3MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.91ms. Allocated memory is still 205.5MB. Free memory was 140.3MB in the beginning and 127.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.41ms. Allocated memory is still 205.5MB. Free memory was 127.6MB in the beginning and 125.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.68ms. Allocated memory is still 205.5MB. Free memory was 125.7MB in the beginning and 123.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 348.08ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 123.6MB in the beginning and 202.5MB in the end (delta: -78.9MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17887.67ms. Allocated memory is still 251.7MB. Free memory was 202.0MB in the beginning and 136.9MB in the end (delta: 65.1MB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 1231 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 948 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 283 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 98 PreInvPairs, 121 NumberOfFragments, 284 HoareAnnotationTreeSize, 98 FormulaSimplifications, 121 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 501 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 818 SizeOfPredicates, 15 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 73/103 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((!((counter < 2)) && (n < 1073741823)) && (((-(n) + r) % 4294967296) == 0)) && (p == 0)) && (h == 0)) || ((((((counter == 1) && !((1 <= r))) && (r == n)) && (q == 1)) && (p == 0)) && (h == 0))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((r == n) && (counter == 0)) && (n < 1073741823)) && (q == 1)) && (p == 0)) && (h == 0)) || (((((((counter == 1) && (4 == q)) && (r == n)) && (1 <= n)) && (n < 1073741823)) && (p == 0)) && (h == 0))) || (((((2 == counter) && (n < 1073741823)) && (((-(n) + r) % 4294967296) == 0)) && (p == 0)) && (h == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:46:27,913 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...