/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/loop-lit/bh2017-ex3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:54:10,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:54:10,908 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-24 22:54:10,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:54:10,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:54:10,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:54:10,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:54:10,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:54:10,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:54:10,939 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:54:10,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:54:10,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:54:10,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:54:10,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:54:10,942 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:54:10,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:54:10,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:54:10,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:54:10,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:54:10,944 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:54:10,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:54:10,945 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:54:10,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:54:10,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:54:10,945 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:54:10,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:54:10,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:54:10,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:54:10,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:54:10,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:54:10,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:54:10,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:54:10,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:54:10,948 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:54:10,948 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-24 22:54:11,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:54:11,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:54:11,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:54:11,165 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:54:11,166 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:54:11,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex3.i [2023-12-24 22:54:12,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:54:12,313 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:54:12,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i [2023-12-24 22:54:12,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ace43e79/2629b55391a04aeba8fa80480c0f6cc5/FLAG0213ee36b [2023-12-24 22:54:12,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ace43e79/2629b55391a04aeba8fa80480c0f6cc5 [2023-12-24 22:54:12,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:54:12,341 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:54:12,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:54:12,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:54:12,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:54:12,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609fc735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12, skipping insertion in model container [2023-12-24 22:54:12,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,365 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:54:12,484 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i[799,812] [2023-12-24 22:54:12,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:54:12,508 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:54:12,518 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i[799,812] [2023-12-24 22:54:12,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:54:12,534 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:54:12,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12 WrapperNode [2023-12-24 22:54:12,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:54:12,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:54:12,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:54:12,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:54:12,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,558 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-12-24 22:54:12,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:54:12,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:54:12,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:54:12,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:54:12,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,581 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-24 22:54:12,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:54:12,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:54:12,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:54:12,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:54:12,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (1/1) ... [2023-12-24 22:54:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:54:12,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:54:12,617 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-24 22:54:12,637 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-24 22:54:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:54:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:54:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:54:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:54:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-24 22:54:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-24 22:54:12,684 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:54:12,687 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:54:12,842 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:54:12,876 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:54:12,876 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 22:54:12,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:54:12 BoogieIcfgContainer [2023-12-24 22:54:12,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:54:12,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:54:12,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:54:12,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:54:12,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:54:12" (1/3) ... [2023-12-24 22:54:12,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af8c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:54:12, skipping insertion in model container [2023-12-24 22:54:12,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:54:12" (2/3) ... [2023-12-24 22:54:12,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af8c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:54:12, skipping insertion in model container [2023-12-24 22:54:12,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:54:12" (3/3) ... [2023-12-24 22:54:12,882 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2023-12-24 22:54:12,895 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:54:12,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:54:12,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:54:12,938 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;@5b560ed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:54:12,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:54:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 22:54:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 22:54:12,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:12,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 22:54:12,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:12,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1248097640, now seen corresponding path program 1 times [2023-12-24 22:54:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553951317] [2023-12-24 22:54:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:12,963 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-24 22:54:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:12,965 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-24 22:54:12,970 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-24 22:54:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:13,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:54:13,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:13,071 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-24 22:54:13,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:13,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553951317] [2023-12-24 22:54:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553951317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:13,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 22:54:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632715368] [2023-12-24 22:54:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:13,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 22:54:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 22:54:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:54:13,100 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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-24 22:54:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:13,188 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2023-12-24 22:54:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 22:54:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-12-24 22:54:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:13,195 INFO L225 Difference]: With dead ends: 56 [2023-12-24 22:54:13,195 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 22:54:13,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-24 22:54:13,199 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:13,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:54:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 22:54:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 22:54:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 22:54:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2023-12-24 22:54:13,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 6 [2023-12-24 22:54:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:13,241 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2023-12-24 22:54:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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-24 22:54:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2023-12-24 22:54:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 22:54:13,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:13,242 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:13,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 22:54:13,448 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-24 22:54:13,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:13,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 675454336, now seen corresponding path program 1 times [2023-12-24 22:54:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562453440] [2023-12-24 22:54:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:13,450 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-24 22:54:13,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:13,451 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-24 22:54:13,453 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-24 22:54:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:13,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:54:13,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:54:13,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:13,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562453440] [2023-12-24 22:54:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562453440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:13,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 22:54:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279958338] [2023-12-24 22:54:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:13,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 22:54:13,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 22:54:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:54:13,508 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 22:54:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:13,569 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2023-12-24 22:54:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 22:54:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-12-24 22:54:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:13,571 INFO L225 Difference]: With dead ends: 93 [2023-12-24 22:54:13,571 INFO L226 Difference]: Without dead ends: 59 [2023-12-24 22:54:13,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-24 22:54:13,572 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:13,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:54:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-24 22:54:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-24 22:54:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-24 22:54:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-24 22:54:13,582 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 11 [2023-12-24 22:54:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:13,582 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-24 22:54:13,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 22:54:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-24 22:54:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 22:54:13,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:13,583 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:13,587 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-24 22:54:13,783 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-24 22:54:13,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:13,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 606007415, now seen corresponding path program 1 times [2023-12-24 22:54:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19007053] [2023-12-24 22:54:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:13,785 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-24 22:54:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:13,786 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-24 22:54:13,789 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-24 22:54:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:13,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:54:13,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 22:54:13,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 22:54:13,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19007053] [2023-12-24 22:54:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19007053] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:13,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 22:54:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740635287] [2023-12-24 22:54:13,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:54:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:54:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:54:13,963 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:14,088 INFO L93 Difference]: Finished difference Result 161 states and 239 transitions. [2023-12-24 22:54:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:54:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-12-24 22:54:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:14,090 INFO L225 Difference]: With dead ends: 161 [2023-12-24 22:54:14,091 INFO L226 Difference]: Without dead ends: 103 [2023-12-24 22:54:14,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:54:14,092 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 65 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:14,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 238 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-24 22:54:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-24 22:54:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 22:54:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-12-24 22:54:14,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 21 [2023-12-24 22:54:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:14,106 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-12-24 22:54:14,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-12-24 22:54:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-24 22:54:14,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:14,107 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:54:14,114 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-24 22:54:14,308 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-24 22:54:14,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:14,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash -617286383, now seen corresponding path program 1 times [2023-12-24 22:54:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:14,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135103188] [2023-12-24 22:54:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:14,312 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-24 22:54:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:14,313 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-24 22:54:14,315 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-24 22:54:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:14,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:54:14,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-24 22:54:14,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-24 22:54:14,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:14,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135103188] [2023-12-24 22:54:14,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135103188] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:14,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:14,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 22:54:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969075195] [2023-12-24 22:54:14,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:14,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:54:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:54:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:54:14,431 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 22:54:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:14,578 INFO L93 Difference]: Finished difference Result 285 states and 433 transitions. [2023-12-24 22:54:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:54:14,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2023-12-24 22:54:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:14,585 INFO L225 Difference]: With dead ends: 285 [2023-12-24 22:54:14,585 INFO L226 Difference]: Without dead ends: 183 [2023-12-24 22:54:14,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:54:14,589 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:14,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 205 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-24 22:54:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-12-24 22:54:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 137 states have (on average 1.416058394160584) internal successors, (194), 137 states have internal predecessors, (194), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 22:54:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 274 transitions. [2023-12-24 22:54:14,614 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 274 transitions. Word has length 26 [2023-12-24 22:54:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:14,615 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 274 transitions. [2023-12-24 22:54:14,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-24 22:54:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 274 transitions. [2023-12-24 22:54:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 22:54:14,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:14,617 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2023-12-24 22:54:14,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 22:54:14,817 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-24 22:54:14,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:14,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1044461023, now seen corresponding path program 1 times [2023-12-24 22:54:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638290773] [2023-12-24 22:54:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:14,819 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-24 22:54:14,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:14,820 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-24 22:54:14,826 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-24 22:54:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:14,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:54:14,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 22:54:14,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 22:54:15,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638290773] [2023-12-24 22:54:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638290773] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:15,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 22:54:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155754765] [2023-12-24 22:54:15,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:15,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:54:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:54:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:54:15,029 INFO L87 Difference]: Start difference. First operand 183 states and 274 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-24 22:54:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:15,196 INFO L93 Difference]: Finished difference Result 555 states and 867 transitions. [2023-12-24 22:54:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 22:54:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65 [2023-12-24 22:54:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:15,199 INFO L225 Difference]: With dead ends: 555 [2023-12-24 22:54:15,199 INFO L226 Difference]: Without dead ends: 373 [2023-12-24 22:54:15,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:54:15,201 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 140 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:15,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 370 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-24 22:54:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2023-12-24 22:54:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 282 states have internal predecessors, (404), 85 states have call successors, (85), 5 states have call predecessors, (85), 5 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-24 22:54:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 574 transitions. [2023-12-24 22:54:15,235 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 574 transitions. Word has length 65 [2023-12-24 22:54:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:15,235 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 574 transitions. [2023-12-24 22:54:15,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-24 22:54:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 574 transitions. [2023-12-24 22:54:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 22:54:15,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:15,237 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2023-12-24 22:54:15,241 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-24 22:54:15,439 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-24 22:54:15,439 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:15,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1907350173, now seen corresponding path program 1 times [2023-12-24 22:54:15,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:15,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365608114] [2023-12-24 22:54:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:54:15,440 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-24 22:54:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:15,441 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-24 22:54:15,442 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-24 22:54:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:54:15,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:54:15,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 22:54:15,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 22:54:15,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365608114] [2023-12-24 22:54:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365608114] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:15,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 22:54:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638028267] [2023-12-24 22:54:15,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:15,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:54:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:54:15,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:54:15,630 INFO L87 Difference]: Start difference. First operand 373 states and 574 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-24 22:54:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:15,790 INFO L93 Difference]: Finished difference Result 1160 states and 1842 transitions. [2023-12-24 22:54:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 22:54:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 65 [2023-12-24 22:54:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:15,799 INFO L225 Difference]: With dead ends: 1160 [2023-12-24 22:54:15,800 INFO L226 Difference]: Without dead ends: 788 [2023-12-24 22:54:15,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:54:15,801 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 133 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:15,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 351 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:54:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-24 22:54:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2023-12-24 22:54:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 602 states have (on average 1.435215946843854) internal successors, (864), 602 states have internal predecessors, (864), 180 states have call successors, (180), 5 states have call predecessors, (180), 5 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2023-12-24 22:54:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1224 transitions. [2023-12-24 22:54:15,862 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1224 transitions. Word has length 65 [2023-12-24 22:54:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:15,862 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1224 transitions. [2023-12-24 22:54:15,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-24 22:54:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1224 transitions. [2023-12-24 22:54:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 22:54:15,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:15,869 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1] [2023-12-24 22:54:15,874 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-24 22:54:16,074 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-24 22:54:16,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:16,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 549477600, now seen corresponding path program 2 times [2023-12-24 22:54:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735362117] [2023-12-24 22:54:16,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:54:16,076 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-24 22:54:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:16,077 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-24 22:54:16,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:54:16,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:54:16,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:16,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 22:54:16,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 36 proven. 252 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 22:54:16,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 36 proven. 252 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 22:54:16,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735362117] [2023-12-24 22:54:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735362117] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:16,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-24 22:54:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376436040] [2023-12-24 22:54:16,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:16,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 22:54:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 22:54:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:54:16,547 INFO L87 Difference]: Start difference. First operand 788 states and 1224 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-24 22:54:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:17,208 INFO L93 Difference]: Finished difference Result 2405 states and 3837 transitions. [2023-12-24 22:54:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 22:54:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 140 [2023-12-24 22:54:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:17,216 INFO L225 Difference]: With dead ends: 2405 [2023-12-24 22:54:17,216 INFO L226 Difference]: Without dead ends: 1618 [2023-12-24 22:54:17,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=478, Unknown=0, NotChecked=0, Total=756 [2023-12-24 22:54:17,219 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 700 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:17,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1430 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:54:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2023-12-24 22:54:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2023-12-24 22:54:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1242 states have (on average 1.4363929146537842) internal successors, (1784), 1242 states have internal predecessors, (1784), 370 states have call successors, (370), 5 states have call predecessors, (370), 5 states have return successors, (370), 370 states have call predecessors, (370), 370 states have call successors, (370) [2023-12-24 22:54:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2524 transitions. [2023-12-24 22:54:17,292 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2524 transitions. Word has length 140 [2023-12-24 22:54:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:17,292 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 2524 transitions. [2023-12-24 22:54:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-24 22:54:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2524 transitions. [2023-12-24 22:54:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 22:54:17,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:17,298 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1] [2023-12-24 22:54:17,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 22:54:17,500 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-24 22:54:17,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:17,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash -755268690, now seen corresponding path program 2 times [2023-12-24 22:54:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003810137] [2023-12-24 22:54:17,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:54:17,501 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-24 22:54:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:17,502 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-24 22:54:17,503 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-24 22:54:17,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:54:17,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:17,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 22:54:17,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 36 proven. 252 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 22:54:17,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:54:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 36 proven. 252 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 22:54:17,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003810137] [2023-12-24 22:54:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003810137] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:54:17,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:54:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-24 22:54:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284161914] [2023-12-24 22:54:17,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:54:17,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 22:54:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 22:54:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-24 22:54:17,957 INFO L87 Difference]: Start difference. First operand 1618 states and 2524 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-24 22:54:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:18,659 INFO L93 Difference]: Finished difference Result 4965 states and 7937 transitions. [2023-12-24 22:54:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 22:54:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 140 [2023-12-24 22:54:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:18,672 INFO L225 Difference]: With dead ends: 4965 [2023-12-24 22:54:18,672 INFO L226 Difference]: Without dead ends: 3348 [2023-12-24 22:54:18,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=478, Unknown=0, NotChecked=0, Total=756 [2023-12-24 22:54:18,678 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 686 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:18,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1362 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:54:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2023-12-24 22:54:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3348. [2023-12-24 22:54:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2582 states have (on average 1.434546862896979) internal successors, (3704), 2582 states have internal predecessors, (3704), 760 states have call successors, (760), 5 states have call predecessors, (760), 5 states have return successors, (760), 760 states have call predecessors, (760), 760 states have call successors, (760) [2023-12-24 22:54:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 5224 transitions. [2023-12-24 22:54:18,830 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 5224 transitions. Word has length 140 [2023-12-24 22:54:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:18,831 INFO L495 AbstractCegarLoop]: Abstraction has 3348 states and 5224 transitions. [2023-12-24 22:54:18,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 20 states have internal predecessors, (98), 19 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-24 22:54:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 5224 transitions. [2023-12-24 22:54:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-24 22:54:18,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:18,837 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1] [2023-12-24 22:54:18,844 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-24 22:54:19,039 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-24 22:54:19,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:19,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1210479488, now seen corresponding path program 3 times [2023-12-24 22:54:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708475927] [2023-12-24 22:54:19,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:54:19,041 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-24 22:54:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:19,042 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-24 22:54:19,045 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-24 22:54:19,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-24 22:54:19,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:19,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:54:19,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4085 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 3883 trivial. 0 not checked. [2023-12-24 22:54:19,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:19,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708475927] [2023-12-24 22:54:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708475927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 22:54:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342343671] [2023-12-24 22:54:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:19,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:54:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:54:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:54:19,162 INFO L87 Difference]: Start difference. First operand 3348 states and 5224 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:19,327 INFO L93 Difference]: Finished difference Result 3354 states and 5229 transitions. [2023-12-24 22:54:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:54:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 290 [2023-12-24 22:54:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:19,339 INFO L225 Difference]: With dead ends: 3354 [2023-12-24 22:54:19,339 INFO L226 Difference]: Without dead ends: 3352 [2023-12-24 22:54:19,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:54:19,341 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:19,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:54:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2023-12-24 22:54:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3352. [2023-12-24 22:54:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 2585 states have (on average 1.4340425531914893) internal successors, (3707), 2585 states have internal predecessors, (3707), 760 states have call successors, (760), 6 states have call predecessors, (760), 6 states have return successors, (760), 760 states have call predecessors, (760), 760 states have call successors, (760) [2023-12-24 22:54:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 5227 transitions. [2023-12-24 22:54:19,505 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 5227 transitions. Word has length 290 [2023-12-24 22:54:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:19,506 INFO L495 AbstractCegarLoop]: Abstraction has 3352 states and 5227 transitions. [2023-12-24 22:54:19,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 5227 transitions. [2023-12-24 22:54:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-24 22:54:19,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:54:19,513 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1] [2023-12-24 22:54:19,517 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-24 22:54:19,715 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-24 22:54:19,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:54:19,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:54:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1473922126, now seen corresponding path program 3 times [2023-12-24 22:54:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:54:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844715773] [2023-12-24 22:54:19,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:54:19,716 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-24 22:54:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:54:19,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:54:19,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 22:54:19,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-24 22:54:19,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:54:19,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:54:19,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:54:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4085 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 3883 trivial. 0 not checked. [2023-12-24 22:54:19,815 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:54:19,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:54:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844715773] [2023-12-24 22:54:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844715773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:54:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:54:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 22:54:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56011691] [2023-12-24 22:54:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:54:19,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:54:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:54:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:54:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:54:19,816 INFO L87 Difference]: Start difference. First operand 3352 states and 5227 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:54:19,990 INFO L93 Difference]: Finished difference Result 3352 states and 5227 transitions. [2023-12-24 22:54:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:54:19,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 290 [2023-12-24 22:54:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:54:19,992 INFO L225 Difference]: With dead ends: 3352 [2023-12-24 22:54:19,992 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 22:54:19,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:54:19,998 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:54:19,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:54:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 22:54:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 22:54:19,998 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-24 22:54:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 22:54:19,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2023-12-24 22:54:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:54:19,999 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 22:54:20,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 22:54:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 22:54:20,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 22:54:20,002 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:54:20,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 22:54:20,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:54:20,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 22:54:36,667 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (not (bvslt |ULTIMATE.start_main_~m~0#1| (_ bv60 32))) (bvsle |ULTIMATE.start_main_~m~0#1| (_ bv60 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~n~0#1|) (_ bv60 32))) [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 29) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~m~0#1|) (_ bv60 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~n~0#1|) (_ bv60 32))) [2023-12-24 22:54:36,668 INFO L895 garLoopResultBuilder]: At program point L19-1(line 19) the Hoare annotation is: (and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~m~0#1|) (_ bv60 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~n~0#1|) (_ bv60 32))) [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L895 garLoopResultBuilder]: At program point L33-1(lines 18 43) the Hoare annotation is: (and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~m~0#1|) (_ bv60 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~n~0#1|) (_ bv60 32))) [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 42) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 22:54:36,668 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~m~0#1|) (_ bv60 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~n~0#1|) (_ bv60 32)) (not (bvslt |ULTIMATE.start_main_~n~0#1| (_ bv60 32)))) [2023-12-24 22:54:36,668 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 40) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 30) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 18 43) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-24 22:54:36,669 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-24 22:54:36,669 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-24 22:54:36,671 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-12-24 22:54:36,672 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:54:36,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:54:36 BoogieIcfgContainer [2023-12-24 22:54:36,678 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:54:36,679 INFO L158 Benchmark]: Toolchain (without parser) took 24337.80ms. Allocated memory was 284.2MB in the beginning and 593.5MB in the end (delta: 309.3MB). Free memory was 241.2MB in the beginning and 314.1MB in the end (delta: -72.9MB). Peak memory consumption was 358.7MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,679 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 179.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:54:36,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.43ms. Allocated memory is still 284.2MB. Free memory was 240.9MB in the beginning and 229.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.11ms. Allocated memory is still 284.2MB. Free memory was 229.9MB in the beginning and 228.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,679 INFO L158 Benchmark]: Boogie Preprocessor took 29.98ms. Allocated memory is still 284.2MB. Free memory was 228.3MB in the beginning and 226.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,680 INFO L158 Benchmark]: RCFGBuilder took 287.31ms. Allocated memory is still 284.2MB. Free memory was 226.6MB in the beginning and 215.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,680 INFO L158 Benchmark]: TraceAbstraction took 23800.51ms. Allocated memory was 284.2MB in the beginning and 593.5MB in the end (delta: 309.3MB). Free memory was 214.3MB in the beginning and 314.1MB in the end (delta: -99.8MB). Peak memory consumption was 331.4MB. Max. memory is 8.0GB. [2023-12-24 22:54:36,681 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 179.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.43ms. Allocated memory is still 284.2MB. Free memory was 240.9MB in the beginning and 229.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.11ms. Allocated memory is still 284.2MB. Free memory was 229.9MB in the beginning and 228.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.98ms. Allocated memory is still 284.2MB. Free memory was 228.3MB in the beginning and 226.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.31ms. Allocated memory is still 284.2MB. Free memory was 226.6MB in the beginning and 215.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23800.51ms. Allocated memory was 284.2MB in the beginning and 593.5MB in the end (delta: 309.3MB). Free memory was 214.3MB in the beginning and 314.1MB in the end (delta: -99.8MB). Peak memory consumption was 331.4MB. 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: 13]: 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 10, TraceHistogramMax: 39, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1916 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1863 mSDsluCounter, 4296 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3647 mSDsCounter, 281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1114 IncrementalHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 281 mSolverCounterUnsat, 649 mSDtfsCounter, 1114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1525 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3352occurred in iteration=9, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 1485 PreInvPairs, 2606 NumberOfFragments, 62 HoareAnnotationTreeSize, 1485 FormulaSimplifications, 11368 FormulaSimplificationTreeSizeReduction, 6.2s HoareSimplificationTime, 6 FormulaSimplificationsInter, 21705 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1054 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 2755 SizeOfPredicates, 6 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 11328/12514 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: 18]: Loop Invariant Derived loop invariant: ((((-1 + m) % 4294967296) < 60) && (((-1 + n) % 4294967296) < 60)) RESULT: Ultimate proved your program to be correct! [2023-12-24 22:54:36,699 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...